✦ LIBER ✦

A bound on the dimension of interval orders

✍ Scribed by K.P Bogart; Issie Rabinovich; W.T Trotter Jr.

Publisher: Elsevier Science
Year: 1976
Tongue: English
Weight: 605 KB
Volume: 21
Category: Article
ISSN: 0097-3165
DOI: 10.1016/0097-3165(76)90004-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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

Partial orders of dimension 2

✍ K. A. Baker; P. C. Fishburn; F. S. Roberts 📂 Article 📅 1972 🏛 John Wiley and Sons 🌐 English ⚖ 873 KB

The jump number problem on interval orde

The jump number problem on interval orders: A 32 approximation algorithm

✍ Maciej M. Sysło 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 556 KB

Path orders of global dimension two

✍ A Wiedemann; K.W Roggenkamp 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 933 KB

A sharp edge bound on the interval numbe

A sharp edge bound on the interval number of a graph

✍ Balogh, J�zsef; Pluh�r, Andr�s 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 201 KB 👁 2 views

The interval number of a graph G, denoted by i(G), is the least natural number t such that G is the intersection graph of sets, each of which is the union of at most t intervals. Here we settle a conjecture of Griggs and West about bounding i(G) in terms of e, that is, the number of edges in G. Name