✦ LIBER ✦

On the directionality of interval orders

✍ Scribed by Vincent Bouchitté; Roland Jégou; Jean-Xavier Rampon

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 336 KB
Volume: 48
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(94)90120-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Interval orders based on weak orders

✍ Kenneth P. Bogart; Joseph Bonin; Jutta Mitas 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 338 KB

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

A bound on the dimension of interval ord

A bound on the dimension of interval orders

✍ K.P Bogart; Issie Rabinovich; W.T Trotter Jr. 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 605 KB

The communication complexity of interval

The communication complexity of interval orders

✍ Ulrich Faigle; Rainer Schrader; György Turán 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 630 KB

An upper bound on the “dimension of inte

An upper bound on the “dimension of interval orders”

✍ I Rabinovitch 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 196 KB

Combinatorial Aspects of Interval Orders

Combinatorial Aspects of Interval Orders and Interval Graphs

✍ William T. Trotter 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 28 KB

We survey recent research on combinatorial properties of interval orders and interval graphs. Topics include: optimization with an uncooperative partner, ramsey trails, sorting with partial information, tree width and graph decompositions, combinatorial extremal problems, shift graphs, Dedekind's en