An implicit representation of chordal comparability graphs in linear time
From MaRDI portal
(Redirected from Publication:972319)
Recommendations
- An Implicit Representation of Chordal Comparabilty Graphs in Linear-Time
- Fast and Simple Algorithms for Recognizing Chordal Comparability Graphs and Interval Graphs
- Cycle-free partial orders and chordal comparability graphs
- scientific article; zbMATH DE number 1554932
- An efficient representation of chordal graphs
Cites work
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3936534 (Why is no real title available?)
- A linear-time algorithm for a special case of disjoint set union
- An Implicit Representation of Chordal Comparabilty Graphs in Linear-Time
- Cycle-free partial orders and chordal comparability graphs
- Efficient graph representations
- Fast and Simple Algorithms for Recognizing Chordal Comparability Graphs and Interval Graphs
- Implicat Representation of Graphs
- Introduction to algorithms
- Modular decomposition and transitive orientation
- Partially Ordered Sets
- The dimension of cycle-free orders
Cited in
(3)
This page was built for publication: An implicit representation of chordal comparability graphs in linear time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q972319)