An implicit representation of chordal comparability graphs in linear time

DOI10.1016/j.dam.2010.01.005zbMath1219.05182OpenAlexW2019249538MaRDI QIDQ972319

Clemente Izurieta, Scott Lundberg, Andrew R. Curtis, Ross M. McConnell, Benson L. 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

zbMATH Keywords

dimensioncomparability graphpartial orderchordal graphperfet graph

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A linear-time algorithm for a special case of disjoint set union
• Cycle-free partial orders and chordal comparability graphs
• Modular decomposition and transitive orientation
• Efficient graph representations
• The dimension of cycle-free orders
• An Implicit Representation of Chordal Comparabilty Graphs in Linear-Time
• Implicat Representation of Graphs
• Fast and Simple Algorithms for Recognizing Chordal Comparability Graphs and Interval Graphs
• Partially Ordered Sets

This page was built for publication: An implicit representation of chordal comparability graphs in linear time