scientific article; zbMATH DE number 1741000

zbMATH Open0994.68095MaRDI QIDQ4331190FDOQ4331190

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

Publication date: 26 September 2002

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

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

graph algorithmsmodular decompositiongraph decompositions

Mathematics Subject Classification ID

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

Cited In (14)

• A distance measure for large graphs based on prime graphs
• Decomposition tree of a lexicographic product of binary structures
• Fully dynamic algorithm for recognition and modular decomposition of permutation graphs
• An efficient exact algorithm for triangle listing in large graphs
• Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
• Linear-time modular decomposition of directed graphs
• Algorithms – ESA 2005
• Routing permutations on graphs via factors
• A survey of the algorithmic aspects of modular decomposition
• Title not available (Why is that?)
• 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)