𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The communication complexity of interval orders

✍ Scribed by Ulrich Faigle; Rainer Schrader; György Turán

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
630 KB
Volume
40
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

On the directionality of interval orders
On the directionality of interval orders
✍ Vincent Bouchitté; Roland Jégou; Jean-Xavier Rampon 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 336 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

Simultaneous representation of interval
Simultaneous representation of interval and interval-containment orders
✍ Paul J. Tanenbaum 📂 Article 📅 1996 🏛 Springer Netherlands 🌐 English ⚖ 658 KB

We characterize the polysemic interval pairs -pairs of posets that admit simultaneous interval and interval-containment representations -and present algorithms to recognize them and construct polysemic interval representations. Mathematics Subject Classifications (1991). 06AO7, 68UO5.