A Parametrized Algorithm for Matroid Branch-Width

DOI10.1137/S0097539702418589zbMath1088.05023MaRDI QIDQ5470690

Petr Hliněný

Publication date: 1 June 2006

Published in: SIAM Journal on Computing (Search for Journal in Brave)

zbMATH Keywords

rank-widthrepresentable matroid

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Combinatorial aspects of matroids and geometric lattices (05B35) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (9)

Trees, grids, and MSO decidability: from graphs to matroids ⋮ First order convergence of matroids ⋮ Matroid tree-width ⋮ A Simpler Self-reduction Algorithm for Matroid Path-Width ⋮ Testing branch-width ⋮ Finding branch-decompositions of matroids, hypergraphs, and more ⋮ Decomposition width of matroids ⋮ Approximating clique-width and branch-width ⋮ Digraphs of Bounded Width

This page was built for publication: A Parametrized Algorithm for Matroid Branch-Width