A Fully dynamic algorithm for recognizing and representing proper interval graphs
From MaRDI portal
Recommendations
- A Fully Dynamic Graph Algorithm for Recognizing Proper Interval Graphs
- Fully dynamic representations of interval graphs
- A fully dynamic graph algorithm for recognizing interval graphs
- Fully dynamic representations of interval graphs
- A dynamic distributed approach to representing proper interval graphs
Cited in
(46)- Polynomial kernels for proper interval completion and related problems
- Integral mixed unit interval graphs
- Normal Helly circular-arc graphs and its subclasses
- scientific article; zbMATH DE number 6810347 (Why is no real title available?)
- Certifying fully dynamic algorithms for recognition and Hamiltonicity of threshold and chain graphs
- Fully dynamic recognition algorithm and certificate for directed cographs
- Interval graph representation with given interval and intersection lengths
- Simultaneous representation of proper and unit interval graphs
- On some subclasses of interval catch digraphs
- Minimal classes of graphs of unbounded clique-width
- 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
- A Fully Dynamic Graph Algorithm for Recognizing Proper Interval Graphs
- Distance queries over dynamic interval graphs
- Dynamic Distance Hereditary Graphs Using Split Decomposition
- A simple algorithm to find Hamiltonian cycles in proper interval graphs
- The interval-merging problem
- Fully dynamic representations of interval graphs
- scientific article; zbMATH DE number 1303554 (Why is no real title available?)
- Simultaneous representation of proper and unit interval graphs
- A fully dynamic algorithm for the recognition of P₄-sparse graphs
- Random Generation and Enumeration of Proper Interval Graphs
- A fully dynamic algorithm for modular decomposition and recognition of cographs.
- A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs
- A certifying and dynamic algorithm for the recognition of proper circular-arc graphs
- The clique-separator graph for chordal graphs
- A characterization of unit interval bigraphs of open and closed intervals
- Dynamically maintaining split graphs
- A polynomial solution to the \(k\)-fixed-endpoint path cover problem on proper interval graphs
- A survey of the algorithmic aspects of modular decomposition
- Recognition of probe proper interval graphs
- Certifying LexBFS Recognition Algorithms for Proper Interval Graphs and Proper Interval Bigraphs
- An optimal algorithm for the k-fixed-endpoint path cover on proper interval graphs
- On characterization and recognition of proper tagged probe interval graphs
- A fully dynamic graph algorithm for recognizing interval graphs
- A dynamic distributed approach to representing proper interval graphs
- Mixed unit interval graphs
- scientific article; zbMATH DE number 7613130 (Why is no real title available?)
- Recognizing and representing proper interval graphs in parallel using merging and sorting
- Canonical antichains of unit interval and bipartite permutation graphs
- A cubic vertex-kernel for \textsc{Trivially Perfect Editing}
- Unit interval graphs: a story with open ends
- Recognizing d-interval graphs and d-track interval graphs
- Fully dynamic representations of interval graphs
- Unit interval graphs of open and closed intervals
This page was built for publication: A Fully dynamic algorithm for recognizing and representing proper interval graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2784453)
