2 search results - page 1 / 1 » Obstructions to branch-decomposition of matroids |
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...
JCT
2006
13 years 5 months ago
2006
