𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On relationships between numerical representations of interval orders and semiorders

✍ Scribed by Susan H Gensemer

Book ID
113181011
Publisher
Elsevier Science
Year
1987
Tongue
English
Weight
698 KB
Volume
43
Category
Article
ISSN
0022-0531

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

[Lecture Notes in Computer Science] Orde
[Lecture Notes in Computer Science] Orders, Algorithms, and Applications Volume 831 || Minimal representation of semiorders with intervals of same length
✍ BouchittΓ©, Vincent; Morvan, Michel πŸ“‚ Article πŸ“… 1994 πŸ› Springer-Verlag 🌐 German βš– 620 KB

This volume is the proceedings of the first International Workshop on Orders, Algorithms, and Applications, held at Lyon, France in July 1994. Ordered sets and the more specifically algorithmic aspects of order theory are of increasing importance, for example in graph theory. They enjoy a recogniz