Sciweavers

70 search results - page 1 / 14
» Safe separators for treewidth
Sort
View
47
Voted
DM
2006
63views more  DM 2006»
14 years 9 months ago
Safe separators for treewidth
Hans L. Bodlaender, Arie M. C. A. Koster
ALGORITHMICA
2007
64views more  ALGORITHMICA 2007»
14 years 9 months ago
Safe Reduction Rules for Weighted Treewidth
Frank van den Eijkhof, Hans L. Bodlaender, Arie M....
STACS
2010
Springer
15 years 4 months ago
Treewidth Reduction for Constrained Separation and Bipartization Problems
We present a method for reducing the treewidth of a graph while preserving all the minimal s−t separators. This technique turns out to be very useful in the design of parameteriz...
Dániel Marx, Barry O'Sullivan, Igor Razgon
EJC
2010
14 years 9 months ago
Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs
We establish relations between the bandwidth and the treewidth of bounded degree graphs G, and relate these parameters to the size of a separator of G as well as the size of an exp...
Julia Böttcher, Klaas P. Pruessmann, Anusch T...
ENDM
2008
88views more  ENDM 2008»
14 years 9 months ago
Bandwidth, treewidth, separators, expansion, and universality
Julia Böttcher, Klaas P. Pruessmann, Anusch T...