A survey of the algorithmic aspects of modular decomposition (Q458504): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Transitiv orientierbare Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(n2) Divide-and-Conquer Algorithm for the Prime Tree Decomposition of Two-Structures and Modular Decomposition of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with unique maximal clumpings / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the X-join decomposition for undirected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3683903 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitive hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Combinatorial Decomposition Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4492680 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast algorithms to enumerate all common intervals of two permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Common Intervals of <i>K</i> Permutations, with Applications to Modular Decomposition of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5678892 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4954442 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3128916 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modular decomposition and transitive orientation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient and Practical Algorithms for Sequential Modular Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4506382 / rank
 
Normal rank
Property / cites work
 
Property / cites work: PARTITION REFINEMENT TECHNIQUES: AN INTERESTING ALGORITHMIC TOOL KIT / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Recognition Algorithm for Cographs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three Partition Refinement Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4331190 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4149476 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Representation Theorem for Union-Difference Families and Application / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear algorithm to decompose inheritance graphs into modules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic aspects of a general modular decomposition theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handle-rewriting hypergraph grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primitivity is hereditary for 2-structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal indecomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: P-Components and the Homogeneous Decomposition of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing $P_4 $-Sparse Graphs in Linear Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tree representation for \(P_ 4\)-sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs indecomposable with respect to the X-join / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complement reducible graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Longest Common Separable Pattern Among Permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient parallel recognition algorithms of cographs and distance hereditary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple linear time algorithm for cograph recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Distance Hereditary Graphs Using Split Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient graph representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of Directed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fully dynamic algorithm for modular decomposition and recognition of cographs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incremental modular decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple Linear Time LexBFS Cograph Recognition Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Aspects of Vertex Elimination on Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully dynamic recognition algorithm and certificate for directed cographs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully Dynamic Representations of Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fully Dynamic Graph Algorithm for Recognizing Proper Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fully Dynamic Algorithm for Recognizing and Representing Proper Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical and efficient split decomposition via graph-labelled trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical and efficient circle graph recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4045961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal proper interval completions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm Theory - SWAT 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restricted permutations and the wreath product / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple permutations and pattern restricted permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3077256 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A more efficient algorithm for perfect sorting by reversals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4736854 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applying modular decomposition to parameterized cluster editing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial Kernels for 3-Leaf Power Graph Modification Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Fixed-Parameter Algorithm for Minimum-Flip Consensus Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter tractability of graph modification problems for hereditary properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: A More Effective Linear Kernelization for Cluster Editing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Parameterized Preprocessing for Cluster Editing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Algorithms for Bicluster Editing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernels for Feedback Arc Set In Tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449222 / rank
 
Normal rank

Revision as of 02:39, 9 July 2024

scientific article
Language Label Description Also known as
English
A survey of the algorithmic aspects of modular decomposition
scientific article

    Statements

    A survey of the algorithmic aspects of modular decomposition (English)
    0 references
    0 references
    0 references
    7 October 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references