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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Algorithmica Ročník 86; číslo 9; s. 2885 - 2928
Hlavní autori:	Oostveen, Jelle J., van Leeuwen, Erik Jan
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.09.2024 Springer Nature B.V
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!