✦ LIBER ✦

Interval representations for interval orders and semiorders

✍ Scribed by Peter C. Fishburn

Publisher: Elsevier Science
Year: 1973
Tongue: English
Weight: 835 KB
Volume: 10
Category: Article
ISSN: 0022-2496
DOI: 10.1016/0022-2496(73)90007-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Aspects of semiorders within interval or

Aspects of semiorders within interval orders

✍ Peter C. Fishburn 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 791 KB

Let sk(n) be the largest integer such that every n-point interval order with NO antichain of more than k points includes an Sk(n)-point 'semiorder. When k = 1, s,(n) = n since all interval ordexs with no two-point antichains are ch:&s.

On the complexity of interval orders and

On the complexity of interval orders and semiorders

✍ U. Faigle; Gy. Turán 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 607 KB

The recognition complexity of interval orders is shown to be Q(n log, n), and an optimal algorithm is given for the identification of semiorders. \* Supported by the joint research project "Algorithmic Aspects of Combinatorial Optimization" of the Hungarian Academy of Sciences (Magyar Tudomanyos Aka

Interval graphs and interval orders

✍ Peter C. Fishburn 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 949 KB

This paper explores the intimate connection between finite interval graphs and interval orders. Special attention is given to the family of interval orders that agree with, or provide representations of, an interval graph. Two characterizations (one by P. Hanlon) of interval graphs with essentially

On families of semiorders and interval o

On families of semiorders and interval orders imbedded in a valued structure of preference: A survey

✍ Marc Roubens; Philippe Vincke 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 536 KB

Gray Codes for the Ideals of Interval Or

Gray Codes for the Ideals of Interval Orders

✍ Michel Habib; Lhouari Nourine; George Steiner 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 218 KB

The generation of combinatorial objects in a Gray code manner means that the difference between successive objects is small, e.g., one element for subsets or one transposition for permutations of a set. The existence of such Gray codes is often equivalent to an appropriately defined graph on these o

Comparability graphs with constraint, pa

Comparability graphs with constraint, partial semi-orders and interval orders

✍ Claude Flament 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 580 KB

A symmetric, anfireflexive relation S is a comparability graph ff one can assign a transitive orientation to the edges: we obtain a partial order. We say that S is a comparability graph with constraint C, a subrelation of S, if S has a transitive orientation including C. A characterization is given