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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Algorithmica Jg. 86; H. 9; S. 2885 - 2928
Hauptverfasser:	Oostveen, Jelle J., van Leeuwen, Erik Jan
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.09.2024 Springer Nature B.V
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!