Contraction Bidimensionality of Geometric Intersection Graphs

Given a graph G , we define bcg ( G ) as the minimum k for which G can be contracted to the uniformly triangulated grid Γ k . A graph class G has the SQG C property if every graph G ∈ G has treewidth O ( bcg ( G ) c ) for some 1 ≤ c < 2 . The SQG C property is important for algorithm design as it...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Algorithmica Ročník 84; číslo 2; s. 510 - 531
Hlavní autori:	Baste, Julien, Thilikos, Dimitrios M.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.02.2022 Springer Nature B.V Springer Verlag
Predmet:	Algorithm Analysis and Problem Complexity Algorithms Combinatorial analysis Computational Complexity Computer Science Computer Systems Organization and Communication Networks Data Structures and Algorithms Data Structures and Information Theory Discrete Mathematics Graphs Mathematics of Computing Theory of Computation Bidimensionality Parameterized algorithms Treewidth Grid exlusion theorem String Graphs Geometric intersection graphs
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!