2 search results - page 1 / 1 » Finding Branch-Decompositions and Rank-Decompositions |
ESA
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. We present a new algorithm that can output the rankdecomposition of width at most k of a graph if such exists. For that we use an algorithm that, for an input matroid rep...
JDA
2010
13 years 2 days ago
2010
We present subexponential parameterized algorithms on planar graphs for a family of problems of the following shape: given a graph, find a connected (induced) subgraph with bounde...