Algorithms for Some H-Join Decompositions
From MaRDI portal
Publication:2894487
DOI10.1007/978-3-642-29344-3_38zbMath1354.05132OpenAlexW58553107MaRDI QIDQ2894487
Fabien de Montgolfier, Antoine Mamcarz, Michel A. Habib
Publication date: 29 June 2012
Published in: LATIN 2012: Theoretical Informatics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-29344-3_38
Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (3)
Computing \(H\)-joins with application to 2-modular decomposition ⋮ Coloring perfect graphs with no balanced skew-partitions ⋮ A polynomial Turing-kernel for weighted independent set in bull-free graphs
This page was built for publication: Algorithms for Some H-Join Decompositions
