Sciweavers

3 search results - page 1 / 1
» Strong-Diameter Decompositions of Minor Free Graphs
Sort
View
MST
2010
74views more  MST 2010»
13 years 8 days ago
Strong-Diameter Decompositions of Minor Free Graphs
Ittai Abraham, Cyril Gavoille, Dahlia Malkhi, Udi ...
SODA
2010
ACM
216views Algorithms» more  SODA 2010»
14 years 2 months ago
Decomposition, Approximation, and Coloring of Odd-Minor-Free Graphs
Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ich...
FSTTCS
2009
Springer
14 years 1 days ago
Domination Problems in Nowhere-Dense Classes
We investigate the parameterized complexity of generalisations and variations of the dominating set problem on classes of graphs that are nowhere dense. In particular, we show that...
Anuj Dawar, Stephan Kreutzer