Pages that link to "Item:Q2499593"
From MaRDI portal
The following pages link to Fully dynamic recognition algorithm and certificate for directed cographs (Q2499593):
Displaying 37 items.
- Algorithms and kernels for \textsc{Feedback Set} problems in generalizations of tournaments (Q329279) (← links)
- Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs (Q415271) (← links)
- A fully dynamic algorithm for the recognition of \(P_4\)-sparse graphs (Q441871) (← links)
- A survey of the algorithmic aspects of modular decomposition (Q458504) (← links)
- Certifying algorithms (Q465678) (← links)
- Acyclic coloring parameterized by directed clique-width (Q831699) (← links)
- Directed NLC-width (Q906393) (← links)
- Fully dynamic representations of interval graphs (Q1711837) (← links)
- Reconstructing gene trees from Fitch's xenology relation (Q1789081) (← links)
- Oriented coloring on recursively defined digraphs (Q2003341) (← links)
- The mathematics of xenology: di-cographs, symbolic ultrametrics, 2-structures and tree-representable systems of binary relations (Q2014353) (← links)
- On characterizations for subclasses of directed co-graphs (Q2025109) (← links)
- From modular decomposition trees to rooted median graphs (Q2074346) (← links)
- The knapsack problem with special neighbor constraints (Q2123119) (← links)
- Computing directed Steiner path covers (Q2125222) (← links)
- Linear-time minimal cograph editing (Q2140496) (← links)
- Generalized Fitch graphs. II: Sets of binary relations that are explained by edge-labeled trees (Q2192103) (← links)
- Exact-2-relation graphs (Q2197422) (← links)
- Solutions for subset sum problems with special digraph constraints (Q2216192) (← links)
- How to compute digraph width measures on directed co-graphs (Q2220888) (← links)
- A certifying and dynamic algorithm for the recognition of proper circular-arc graphs (Q2232611) (← links)
- Efficient computation of the oriented chromatic number of recursively defined digraphs (Q2235732) (← links)
- Reciprocal best match graphs (Q2299268) (← links)
- Comparing linear width parameters for directed graphs (Q2322714) (← links)
- Generalized Fitch graphs: edge-labeled graphs that are explained by edge-labeled trees (Q2322864) (← links)
- Fully dynamic recognition of proper circular-arc graphs (Q2350902) (← links)
- Best match graphs (Q2420450) (← links)
- Arc-Disjoint Paths in Decomposable Digraphs (Q2922218) (← links)
- Miscellaneous Digraph Classes (Q3120443) (← links)
- Computing Directed Steiner Path Covers for Directed Co-graphs (Extended Abstract) (Q3297784) (← links)
- A semi-strong perfect digraph theorem (Q4956212) (← links)
- Faster and enhanced inclusion-minimal cograph completion (Q5915859) (← links)
- Fully dynamic algorithm for recognition and modular decomposition of permutation graphs (Q5961976) (← links)
- Twin-distance-hereditary digraphs (Q6132965) (← links)
- A System of Interaction and Structure III: The Complexity of BV and Pomset Logic (Q6137849) (← links)
- Fitch graph completion (Q6591635) (← links)
- The knapsack problem with special neighbor constraints on directed co-graphs (Q6606640) (← links)
