Counting endpoint sequences for interval orders and interval graphs

DOI10.1016/0012-365X(93)90353-UzbMath0781.68089WikidataQ127952212 ScholiaQ127952212MaRDI QIDQ685648

Martin Charles Golumbic, Alexander Belfer

Publication date: 24 October 1993

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

intervalinterval graphtemporal reasoning\(MPQ\)-trees\(PQ\)-treesendpoint sequences

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30)

Related Items (1)

Transitive closure for restricted classes of partial orders

Cites Work

• Unnamed Item
• Maintaining knowledge about temporal intervals
• Interval graphs and related topics
• Interval graphs and interval orders
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• Incidence matrices and interval graphs
• Incidence matrices, interval graphs and seriation in archeology
• Counting Interval Graphs
• An Incremental Linear-Time Algorithm for Recognizing Interval Graphs
• A Characterization of Comparability Graphs and of Interval Graphs

This page was built for publication: Counting endpoint sequences for interval orders and interval graphs