A linear time and space algorithm to recognize interval orders

DOI10.1016/0166-218X(93)90027-LzbMATH Open0848.68069MaRDI QIDQ689975FDOQ689975

Authors: Philippe Baldy, M. Morvan 

Publication date: 8 October 1996

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

Mathematics Subject Classification ID

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

Cites Work

• Scheduling Interval-Ordered Tasks
• Title not available (Why is that?)
• Betweenness, orders and interval graphs

Cited In (4)

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

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)