Finding Branch-Decompositions and Rank-Decompositions

DOI10.1007/978-3-540-75520-3_16zbMath1151.05046OpenAlexW1958935252MaRDI QIDQ5900367

Petr Hliněný, Sang-il Oum

Publication date: 25 September 2008

Published in: Algorithms – ESA 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-75520-3_16

zbMATH Keywords

graphmatroidclique-widthrank-widthbranch-widthfixed parameter tractable algorithm

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Combinatorial aspects of matroids and geometric lattices (05B35) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Efficient First-Order Model-Checking Using Short Labels ⋮ Graph Operations Characterizing Rank-Width and Balanced Graph Expressions ⋮ On complexities of minus domination ⋮ Linear delay enumeration and monadic second-order logic ⋮ Graph operations characterizing rank-width ⋮ Matrices of Optimal Tree-Depth and a Row-Invariant Parameterized Algorithm for Integer Programming