Parameterized Complexity of Streaming Diameter and Connectivity Problems

We initiate the investigation of the parameterized complexity of Diameter and Connectivity in the streaming paradigm. On the positive end, we show that knowing a vertex cover of size k allows for algorithms in the Adjacency List (AL) streaming model whose number of passes is constant and memory is O...

Full description

Saved in:

Bibliographic Details
Published in:	Algorithmica Vol. 86; no. 9; pp. 2885 - 2928
Main Authors:	Oostveen, Jelle J., van Leeuwen, Erik Jan
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.09.2024 Springer Nature B.V
Subjects:	Algorithm Analysis and Problem Complexity Algorithms Apexes Complexity Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Graph theory Graphs Lower bounds Mathematics of Computing Parameterization Parameters Theory of Computation Streaming Permutation Vertex cover Graphs Parameter Connectivity Stream Diameter Disjointness Complexity
ISSN:	0178-4617, 1432-0541
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!