Bounded discrete representations of interval orders

DOI10.1016/0166-218X(93)90229-HzbMath0787.06003OpenAlexW1969070807MaRDI QIDQ686255

Garth Isaak

Publication date: 19 May 1994

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

Full work available at URL: https://doi.org/10.1016/0166-218x(93)90229-h

zbMATH Keywords

directed graphflowFarkas' Lemmaassociated linear algebrabounded discrete representationclosed interval representationfinite interval ordernegative cyclepolynomial time decision algorithmvertex-incidence matrix

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Deterministic network models in operations research (90B10) Paths and cycles (05C38)

Related Items (4)

Dimension of restricted classes of interval orders ⋮ Interval graphs with side (and size) constraints ⋮ Bounded, minimal, and short representations of unit interval and unit circular-arc graphs. Chapter I: theory ⋮ Representing interval orders by weighted bases: some complexity results

Cites Work

• Interval graphs and interval orders
• Betweenness, orders and interval graphs
• Threshold-Bounded Interval Orders and a Theory of Picycles
• Classes of interval graphs under expanding length restrictions
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Bounded discrete representations of interval orders