A survey of the algorithmic aspects of modular decomposition
type: Item
instance of: scholarly article
title: A survey of the algorithmic aspects of modular decomposition
zbMATH Open document ID: 1302.68140
author: Christophe Paul
author: Michel Habib
published in: Computer Science Review
publication date: 2014-10-07T00:00:00Z
full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C90
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68-02
Mathematics Subject Classification ID: 05-02
zbMATH DE Number: 6352124
MaRDI profile type: Publication
OpenAlex ID: W2019030165
cites work: Transitiv orientierbare Graphen
cites work: An O(n2) Divide-and-Conquer Algorithm for the Prime Tree Decomposition of Two-Structures and Modular Decomposition of Graphs
cites work: Graphs with unique maximal clumpings
cites work: On the X-join decomposition for undirected graphs
cites work: Q3683903
cites work: A characterization of perfect graphs
cites work: Q3328583
cites work: Graph Classes: A Survey
cites work: Partitive hypergraphs
cites work: A Combinatorial Decomposition Theory
cites work: Q4492680
cites work: Fast algorithms to enumerate all common intervals of two permutations
cites work: Computing Common Intervals of K Permutations, with Applications to Modular Decomposition of Graphs
cites work: Q5678892
cites work: Q4954442
cites work: Q3128916
cites work: Modular decomposition and transitive orientation
cites work: Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
cites work: Efficient and practical algorithms for sequential modular decomposition
cites work: Q4506382
cites work: PARTITION REFINEMENT TECHNIQUES: AN INTERESTING ALGORITHMIC TOOL KIT
cites work: A Linear Recognition Algorithm for Cographs
cites work: Three Partition Refinement Algorithms
cites work: Q4331190
cites work: Q4149476
cites work: A Representation Theorem for Union-Difference Families and Application
cites work: A linear algorithm to decompose inheritance graphs into modules
cites work: Algorithmic aspects of a general modular decomposition theory
cites work: Handle-rewriting hypergraph grammars
cites work: Primitivity is hereditary for 2-structures
cites work: Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures
cites work: Minimal indecomposable graphs
cites work: P-Components and the Homogeneous Decomposition of Graphs
cites work: Recognizing $P_4 $-Sparse Graphs in Linear Time
cites work: A tree representation for \(P_ 4\)-sparse graphs
cites work: Graphs indecomposable with respect to the X-join
cites work: Complement reducible graphs
cites work: Longest Common Separable Pattern Among Permutations
cites work: Efficient parallel recognition algorithms of cographs and distance hereditary graphs
cites work: A simple linear time algorithm for cograph recognition
cites work: Graph-Theoretic Concepts in Computer Science
cites work: Dynamic Distance Hereditary Graphs Using Split Decomposition
cites work: Efficient graph representations
cites work: Decomposition of Directed Graphs
cites work: A fully dynamic algorithm for modular decomposition and recognition of cographs.
cites work: Incremental modular decomposition
cites work: A Simple Linear Time LexBFS Cograph Recognition Algorithm
cites work: Algorithmic Aspects of Vertex Elimination on Graphs
cites work: Fully dynamic recognition algorithm and certificate for directed cographs
cites work: Fully Dynamic Representations of Interval Graphs
cites work: A Fully Dynamic Graph Algorithm for Recognizing Proper Interval Graphs
cites work: A Fully dynamic algorithm for recognizing and representing proper interval graphs
cites work: Practical and efficient split decomposition via graph-labelled trees
cites work: Practical and efficient circle graph recognition
cites work: Q4045961
cites work: Minimal proper interval completions
cites work: Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing
cites work: A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs
cites work: Algorithms – ESA 2005

A survey of the algorithmic aspects of modular decomposition (cites work)
cites work: Algorithm Theory - SWAT 2004

A survey of the algorithmic aspects of modular decomposition (cites work)
cites work: Restricted permutations and the wreath product

A survey of the algorithmic aspects of modular decomposition (cites work)
cites work: Simple permutations and pattern restricted permutations

A survey of the algorithmic aspects of modular decomposition (cites work)
cites work: Q3077256

A survey of the algorithmic aspects of modular decomposition (cites work)
cites work: Algorithms and Computation

A survey of the algorithmic aspects of modular decomposition (cites work)
cites work: A more efficient algorithm for perfect sorting by reversals

A survey of the algorithmic aspects of modular decomposition (cites work)
cites work: Q4393480

A survey of the algorithmic aspects of modular decomposition (cites work)
cites work: Q5710169

A survey of the algorithmic aspects of modular decomposition (cites work)
cites work: Q4736854

A survey of the algorithmic aspects of modular decomposition (cites work)
cites work: Applying modular decomposition to parameterized cluster editing problems

A survey of the algorithmic aspects of modular decomposition (cites work)
cites work: Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments

A survey of the algorithmic aspects of modular decomposition (cites work)
cites work: Polynomial Kernels for 3-Leaf Power Graph Modification Problems

A survey of the algorithmic aspects of modular decomposition (cites work)
cites work: An Improved Fixed-Parameter Algorithm for Minimum-Flip Consensus Trees

A survey of the algorithmic aspects of modular decomposition (cites work)
cites work: Fixed-parameter tractability of graph modification problems for hereditary properties

A survey of the algorithmic aspects of modular decomposition (cites work)
cites work: A More Effective Linear Kernelization for Cluster Editing

A survey of the algorithmic aspects of modular decomposition (cites work)
cites work: Efficient Parameterized Preprocessing for Cluster Editing

A survey of the algorithmic aspects of modular decomposition (cites work)
cites work: Improved Algorithms for Bicluster Editing

A survey of the algorithmic aspects of modular decomposition (cites work)
cites work: Kernels for feedback arc set in tournaments

A survey of the algorithmic aspects of modular decomposition (cites work)
cites work: Q4449222

A survey of the algorithmic aspects of modular decomposition (DOI)
DOI: 10.1016/J.COSREV.2010.01.001