An Implicit Representation of Chordal Comparabilty Graphs in Linear-Time

DOI10.1007/11917496_16MaRDI QIDQ3522954zbMATH OpenOpenAlexFDO

Authors Andrew R. Curtis, Clemente Izurieta, Scott Lundberg, Benson Joeris, R. M. McConnell

Publication date 4 September 2008

Published in Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11917496_16

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62) Graph algorithms (graph-theoretic aspects) (05C85) Combinatorics of partially ordered sets (06A07) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• An implicit representation of chordal comparability graphs in linear time
• scientific article; zbMATH DE number 1554932
• Fast and Simple Algorithms for Recognizing Chordal Comparability Graphs and Interval Graphs
• Cycle-free partial orders and chordal comparability graphs
• Sequential and parallel algorithms on compactly represented chordal and strongly chordal graphs

Cited in

(3)

• Construction of a simple elimination scheme for a chordal comparability graph in linear time
• scientific article; zbMATH DE number 7651152 (Why is no real title available?)
• An implicit representation of chordal comparability graphs in linear time

This page was built for publication: An Implicit Representation of Chordal Comparabilty Graphs in Linear-Time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3522954)