Fast and Simple Algorithms for Recognizing Chordal Comparability Graphs and Interval Graphs
From MaRDI portal
Publication:4229420
Recommendations
Cited in
(19)- Organizing the atoms of the clique separator decomposition into an atom tree
- Interval graph representation with given interval and intersection lengths
- Linear-time algorithms for tree root problems
- An implicit representation of chordal comparability graphs in linear time
- Representing a concept lattice by a graph
- A Fully Dynamic Graph Algorithm for Recognizing Proper Interval Graphs
- Hermes: a simple and efficient algorithm for building the AOC-poset of a binary relation
- Addendum: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- Modular decomposition and transitive orientation
- A simple algorithm to find Hamiltonian cycles in proper interval graphs
- Computing the clique-separator graph for an interval graph in linear time
- Construction of a simple elimination scheme for a chordal comparability graph in linear time
- Happy set problem on subclasses of co-comparability graphs
- Fast algorithms of dually chordal graphs
- An Implicit Representation of Chordal Comparabilty Graphs in Linear-Time
- A fully dynamic graph algorithm for recognizing interval graphs
- Happy set problem on subclasses of co-comparability graphs
- A local approach to concept generation
- Fully dynamic representations of interval graphs
This page was built for publication: Fast and Simple Algorithms for Recognizing Chordal Comparability Graphs and Interval Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4229420)