scientific article; zbMATH DE number 1741000

MaRDI QIDQ4331190zbMATH OpenFDO

Authors Christian Capelle, Fabien De Montgolfier, M. A. Habib

Publication date 26 September 2002

Full work available at URL https://eudml.org/doc/122065

zbMATH Keywords

graph algorithmsmodular decompositiongraph decompositions

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
• Algorithm Theory - SWAT 2004
• scientific article; zbMATH DE number 1003286
• scientific article; zbMATH DE number 1456953
• Incremental modular decomposition

Cited in

(14)

• A distance measure for large graphs based on prime graphs
• Decomposition tree of a lexicographic product of binary structures
• An efficient exact algorithm for triangle listing in large graphs
• Fully dynamic algorithm for recognition and modular decomposition of permutation graphs
• Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
• Linear-time modular decomposition of directed graphs
• Routing permutations on graphs via factors
• Algorithms – ESA 2005
• A survey of the algorithmic aspects of modular decomposition
• scientific article; zbMATH DE number 4179385 (Why is no real title available?)
• Algorithmic aspects of a general modular decomposition theory
• Complete edge-colored permutation graphs
• A simple linear time algorithm for cograph recognition
• A general algorithmic scheme for combinatorial decompositions with application to modular decompositions of hypergraphs

This page was built for publication:

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