Satisfiability problems on intervals and unit intervals

Itsik Pe'er*, Ron Shamir

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

17 Scopus citations

Abstract

For an interval graph with some additional order constraints between pairs of non-intersecting intervals, we give a linear time algorithm to determine if there exists a realization which respects the order constraints. Previous algorithms for this problem (known also as seriation with side constraints) required quadratic time. This problem contains as subproblems interval graph and interval order recognition. On the other hand, it is a special case of the interval satisfiability problem, which is concerned with the realizability of a set of intervals along a line, subject to precedence and intersection constraints. We study such problems for all possible restrictions on the types of constraints, when all intervals must have the same length. We give efficient algorithms for several restrictions of the problem, and show the NP-completeness of another restriction.

Original languageEnglish
Pages (from-to)349-372
Number of pages24
JournalTheoretical Computer Science
Volume175
Issue number2
DOIs
StatePublished - 10 Apr 1997

Funding

FundersFunder number
Ministry of Science and the Arts, Israel

    Fingerprint

    Dive into the research topics of 'Satisfiability problems on intervals and unit intervals'. Together they form a unique fingerprint.

    Cite this