scientific article; zbMATH DE number 1741000
From MaRDI portal
Publication:4331190
zbMath0994.68095MaRDI QIDQ4331190
Fabien de Montgolfier, Christian Capelle, Michel A. Habib
Publication date: 26 September 2002
Full work available at URL: https://eudml.org/doc/122065
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10)
Related Items (10)
A general algorithmic scheme for combinatorial decompositions with application to modular decompositions of hypergraphs ⋮ Complete edge-colored permutation graphs ⋮ Decomposition tree of a lexicographic product of binary structures ⋮ A survey of the algorithmic aspects of modular decomposition ⋮ An efficient exact algorithm for triangle listing in large graphs ⋮ A distance measure for large graphs based on prime graphs ⋮ A simple linear time algorithm for cograph recognition ⋮ Linear-time modular decomposition of directed graphs ⋮ Faster and enhanced inclusion-minimal cograph completion ⋮ Algorithmic aspects of a general modular decomposition theory
This page was built for publication:
