Linear Time Split Decomposition Revisited

DOI10.1137/10080052XzbMath1248.68369OpenAlexW2015516462MaRDI QIDQ2910928

Mathieu Raffinot, Fabien de Montgolfier, Pierre Charbit

Publication date: 12 September 2012

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/10080052x

zbMATH Keywords

graph decomposition1-join decomposition

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (13)

Between treewidth and clique-width ⋮ Detecting 2-joins faster ⋮ Between Treewidth and Clique-Width ⋮ On polygon numbers of circle graphs and distance hereditary graphs ⋮ Meta-kernelization with structural parameters ⋮ Solving problems on graphs of high rank-width ⋮ Practical and efficient split decomposition via graph-labelled trees ⋮ Computing \(H\)-joins with application to 2-modular decomposition ⋮ The \(b\)-\textsc{Matching} problem in distance-hereditary graphs and beyond ⋮ On complexities of minus domination ⋮ Unnamed Item ⋮ Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs ⋮ On Computing the Gromov Hyperbolicity

This page was built for publication: Linear Time Split Decomposition Revisited