๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Inductive Characterizations of Finite Interval Orders and Semiorders

โœ Scribed by Jimmy Leblet; Jean-Xavier Rampon


Publisher
Springer Netherlands
Year
2009
Tongue
English
Weight
224 KB
Volume
26
Category
Article
ISSN
0167-8094

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Aspects of semiorders within interval or
โœ 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.

On the complexity of interval orders and
โœ 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