Algorithm Theory - SWAT 2004

DOI10.1007/b98413zbMath1095.68622OpenAlexW2615963353MaRDI QIDQ5315370

Fabien de Montgolfier, Christophe Paul, Michel A. Habib

Publication date: 7 September 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b98413

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) 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) Data structures (68P05)

Related Items (21)

Minimal separators in \(P_4\)-sparse graphs ⋮ Parameterized algorithms for edge biclique and related problems ⋮ An Analytic Propositional Proof System on Graphs ⋮ The use of a pruned modular decomposition for \textsc{maximum matching} algorithms on some graph classes ⋮ From modular decomposition trees to level-1 networks: pseudo-cographs, polar-cats and prime polar-cats ⋮ A general algorithmic scheme for combinatorial decompositions with application to modular decompositions of hypergraphs ⋮ Autonomous sets for the hypergraph of all canonical covers ⋮ Almost every graph is divergent under the biclique operator ⋮ Cograph editing: Merging modules is equivalent to editing P_4s ⋮ Tight lower bounds on the number of bicliques in false-twin-free graphs ⋮ A survey of the algorithmic aspects of modular decomposition ⋮ Partitioned probe comparability graphs ⋮ An efficient exact algorithm for triangle listing in large graphs ⋮ A distance measure for large graphs based on prime graphs ⋮ Transitive orientations in bull-reducible Berge graphs ⋮ On probe permutation graphs ⋮ Applying modular decomposition to parameterized cluster editing problems ⋮ Autonomous Sets – A Method for Hypergraph Decomposition with Applications in Database Theory ⋮ Algorithmic aspects of a general modular decomposition theory ⋮ Vertex removal in biclique graphs ⋮ Some results on more flexible versions of Graph Motif

This page was built for publication: Algorithm Theory - SWAT 2004