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

Full description

Saved in:

Bibliographic Details
Published in:	Algorithmica Vol. 84; no. 2; pp. 510 - 531
Main Authors:	Baste, Julien, Thilikos, Dimitrios M.
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.02.2022 Springer Nature B.V Springer Verlag
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!