An implicit representation of chordal comparability graphs in linear time
type: Item
instance of: scholarly article
title: An implicit representation of chordal comparability graphs in linear time
zbMATH Open document ID: 1219.05182
author: Andrew R. Curtis
author: Clemente Izurieta
author: Scott Lundberg
author: R. M. McConnell
author: Benson Joeris
published in: Discrete Applied Mathematics
publication date: 2010-05-25T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C62
zbMATH DE Number: 5711854
zbMATH Keywords: comparability graph
zbMATH Keywords: chordal graph
zbMATH Keywords: perfet graph
zbMATH Keywords: partial order
zbMATH Keywords: dimension
MaRDI profile type: Publication
full work available at URL: j.dam.2010.01.005
OpenAlex ID: W2019249538
cites work: Introduction to algorithms
cites work: An Implicit Representation of Chordal Comparabilty Graphs in Linear-Time
cites work: Partially Ordered Sets
cites work: A linear-time algorithm for a special case of disjoint set union
cites work: Q3328583
cites work: Fast and Simple Algorithms for Recognizing Chordal Comparability Graphs and Interval Graphs
cites work: Implicat Representation of Graphs
cites work: The dimension of cycle-free orders
cites work: Cycle-free partial orders and chordal comparability graphs
cites work: Modular decomposition and transitive orientation
cites work: Efficient graph representations
cites work: Q3707420
DOI: 10.1016/J.DAM.2010.01.005
description: scientific article; zbMATH DE number 5711854