A linear time and space algorithm to recognize interval orders

DOI10.1016/0166-218X(93)90027-LMaRDI QIDQ689975zbMATH OpenFDO

Authors Philippe Baldy, M. Morvan

Publication date 8 October 1996

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

Full work available at URL https://doi.org/10.1016/0166-218X(93)90027-L

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Cites work

• Betweenness, orders and interval graphs
• scientific article; zbMATH DE number 6157240 (Why is no real title available?)
• Scheduling Interval-Ordered Tasks

Cited in

(5)

• Satisfiability problems on intervals and unit intervals
• Simplicial elimination schemes, extremal lattices and maximal antichain lattices
• Generation and enumeration of some classes of interval orders
• Parallel interval order recognition and construction of interval representations
• Width notions for ordering-related problems

This page was built for publication: A linear time and space algorithm to recognize interval orders

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