Fully dynamic recognition algorithm and certificate for directed cographs
From MaRDI portal
Publication:2499593
Recommendations
- Graph-Theoretic Concepts in Computer Science
- A fully dynamic algorithm for modular decomposition and recognition of cographs.
- A fully dynamic algorithm for recognizing and representing chordal graphs
- Graph-Theoretic Concepts in Computer Science
- Fully dynamic algorithm for recognition and modular decomposition of permutation graphs
Cites work
- scientific article; zbMATH DE number 3906240 (Why is no real title available?)
- scientific article; zbMATH DE number 3558962 (Why is no real title available?)
- scientific article; zbMATH DE number 1305520 (Why is no real title available?)
- scientific article; zbMATH DE number 2079335 (Why is no real title available?)
- A Fully dynamic algorithm for recognizing and representing proper interval graphs
- A Linear Recognition Algorithm for Cographs
- A fully dynamic algorithm for modular decomposition and recognition of cographs.
- A simple linear time LexBFS cograph recognition algorithm.
- Bipartite graphs totally decomposable by canonical decomposition
- Complement reducible graphs
- Graph-Theoretic Concepts in Computer Science
- Graph-Theoretic Concepts in Computer Science
- Incremental modular decomposition
- LINEAR TIME RECOGNITION AND OPTIMIZATIONS FOR WEAK-BISPLIT GRAPHS, BI-COGRAPHS AND BIPARTITE P6-FREE GRAPHS
- Primitivity is hereditary for 2-structures
- The Recognition of Series Parallel Digraphs
Cited in
(38)- Directed NLC-width
- Acyclic coloring parameterized by directed clique-width
- A System of Interaction and Structure III: The Complexity of BV and Pomset Logic
- Arc-disjoint paths in decomposable digraphs
- Fully dynamic recognition of proper circular-arc graphs
- Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs
- Fully dynamic algorithm for recognition and modular decomposition of permutation graphs
- Twin-distance-hereditary digraphs
- Reconstructing gene trees from Fitch's xenology relation
- Computing directed Steiner path covers
- Efficient computation of the oriented chromatic number of recursively defined digraphs
- Fitch graph completion
- Computing directed Steiner path covers for directed co-graphs (extended abstract)
- Oriented coloring on recursively defined digraphs
- On characterizations for subclasses of directed co-graphs
- The mathematics of xenology: di-cographs, symbolic ultrametrics, 2-structures and tree-representable systems of binary relations
- A fully dynamic algorithm for the recognition of P₄-sparse graphs
- A fully dynamic algorithm for modular decomposition and recognition of cographs.
- The knapsack problem with special neighbor constraints on directed co-graphs
- A certifying and dynamic algorithm for the recognition of proper circular-arc graphs
- Comparing linear width parameters for directed graphs
- Solutions for subset sum problems with special digraph constraints
- Best match graphs
- Algorithms and kernels for \textsc{Feedback Set} problems in generalizations of tournaments
- A survey of the algorithmic aspects of modular decomposition
- Reciprocal best match graphs
- Exact-2-relation graphs
- The knapsack problem with special neighbor constraints
- Graph-Theoretic Concepts in Computer Science
- Certifying algorithms
- How to compute digraph width measures on directed co-graphs
- From modular decomposition trees to rooted median graphs
- Generalized Fitch graphs. II: Sets of binary relations that are explained by edge-labeled trees
- Generalized Fitch graphs: edge-labeled graphs that are explained by edge-labeled trees
- Miscellaneous digraph classes
- A semi-strong perfect digraph theorem
- Fully dynamic representations of interval graphs
- Linear-time minimal cograph editing
This page was built for publication: Fully dynamic recognition algorithm and certificate for directed cographs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2499593)
