Bounded discrete representations of interval orders
DOI10.1016/0166-218X(93)90229-HzbMATH Open0787.06003OpenAlexW1969070807MaRDI QIDQ686255FDOQ686255
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
Recommendations
directed graphflowFarkas' Lemmaassociated linear algebrabounded discrete representationclosed interval representationfinite interval ordernegative cyclepolynomial time decision algorithmvertex-incidence matrix
Deterministic network models in operations research (90B10) Paths and cycles (05C38) Combinatorics of partially ordered sets (06A07)
Cites Work
Cited In (12)
- Représentation de familles ordonnées d'intervalles et applications
- Simultaneous representation of interval and interval-containment orders
- Continuous representability of interval orders
- Numerical representations of interval orders
- Bounded, minimal, and short representations of unit interval and unit circular-arc graphs. Chapter I: theory
- Continuous representability of interval orders and biorders
- Threshold-Bounded Interval Orders and a Theory of Picycles
- Interval graphs with side (and size) constraints
- Representing interval orders by weighted bases: some complexity results
- Title not available (Why is that?)
- Dimension of restricted classes of interval orders
- Interval orders without odd crowns are defect optimal
This page was built for publication: Bounded discrete representations of interval orders
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q686255)