Algorithm Theory - SWAT 2004

DOI10.1007/B98413MaRDI QIDQ5315370zbMATH OpenOpenAlexFDO

Authors Fabien De Montgolfier, Christophe Paul, M. 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

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

Recommendations

• Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
• scientific article; zbMATH DE number 1456953
• scientific article; zbMATH DE number 1003286
• Efficient and practical algorithms for sequential modular decomposition
• Modular decomposition and transitive orientation

Cited in

(29)

• A distance measure for large graphs based on prime graphs
• Transitive orientations in bull-reducible Berge graphs
• scientific article; zbMATH DE number 1741000 (Why is no real title available?)
• The use of a pruned modular decomposition for \textsc{maximum matching} algorithms on some graph classes
• Cograph editing: Merging modules is equivalent to editing P₄s
• Partitioned probe comparability graphs
• On probe permutation graphs
• An efficient exact algorithm for triangle listing in large graphs
• Parameterized algorithms for edge biclique and related problems
• An Algorithm for the Modular Decomposition of Hypergraphs
• Autonomous sets for the hypergraph of all canonical covers
• Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
• Graph Drawing
• Linear-time modular decomposition of directed graphs
• Autonomous Sets – A Method for Hypergraph Decomposition with Applications in Database Theory
• Tight lower bounds on the number of bicliques in false-twin-free graphs
• Applying modular decomposition to parameterized cluster editing problems
• A survey of the algorithmic aspects of modular decomposition
• Drawing graphs using modular decomposition
• Algorithmic aspects of a general modular decomposition theory
• Minimal separators in \(P_4\)-sparse graphs
• From modular decomposition trees to level-1 networks: pseudo-cographs, polar-cats and prime polar-cats
• Almost every graph is divergent under the biclique operator
• Capturing polynomial time using modular decomposition
• Efficient and practical algorithms for sequential modular decomposition
• Some results on more flexible versions of Graph Motif
• An Analytic Propositional Proof System on Graphs
• A general algorithmic scheme for combinatorial decompositions with application to modular decompositions of hypergraphs
• Vertex removal in biclique graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5315370)