An implicit representation of chordal comparability graphs in linear time
DOI10.1016/J.DAM.2010.01.005zbMATH Open1219.05182OpenAlexW2019249538MaRDI QIDQ972319FDOQ972319
Authors: Andrew R. Curtis, Clemente Izurieta, Scott Lundberg, R. M. McConnell, Benson Joeris 
Publication date: 25 May 2010
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2010.01.005
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
Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Introduction to algorithms
- Title not available (Why is that?)
- Modular decomposition and transitive orientation
- Efficient graph representations
- Title not available (Why is that?)
- A linear-time algorithm for a special case of disjoint set union
- Partially Ordered Sets
- Implicat Representation of Graphs
- Fast and Simple Algorithms for Recognizing Chordal Comparability Graphs and Interval Graphs
- Cycle-free partial orders and chordal comparability graphs
- The dimension of cycle-free orders
- An Implicit Representation of Chordal Comparabilty Graphs in Linear-Time
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)
