✦ LIBER ✦

The dimension of semiorders

✍ Scribed by I Rabinovitch

Publisher: Elsevier Science
Year: 1978
Tongue: English
Weight: 633 KB
Volume: 25
Category: Article
ISSN: 0097-3165
DOI: 10.1016/0097-3165(78)90030-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Scott-Suppes theorem on semiorders

✍ Issie Rabinovitch 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 192 KB

Semiorders and risky choices

✍ Peter C. Fishburn 📂 Article 📅 1968 🏛 Elsevier Science 🌐 English ⚖ 247 KB

The recognition of indifference digraphs

The recognition of indifference digraphs and generalized semiorders

✍ Steiner, George 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 434 KB 👁 2 views

A digraph is an interval digraph if each vertex can be assigned a source interval and a sink interval on the real line such that there is an edge from u to u if and only if the source interval for u intersects the sink interval for u . A digraph is an indifference digraph or unit interval digraph if

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

Generalizations of Semiorders: A Review

Generalizations of Semiorders: A Review Note

✍ Peter C. Fishburn 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 419 KB

Semiorders may form the simplest class of partially ordered sets that accommodate thresholds of discriminability in binary comparisons. Many other classes of ordered sets that generalize the uniform-threshold feature of semiorders have been studied in recent years. This note describes a variety of g

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.