✦ LIBER ✦

A Loopless Algorithm for Generation of Basic Minimal Interval Orders

✍ Scribed by Paul S. LaFollette; James F. Korsh

Book ID: 111568209
Publisher: Springer Netherlands
Year: 2000
Tongue: English
Weight: 70 KB
Volume: 17
Category: Article
ISSN: 0167-8094
DOI: 10.1023/a:1026790306863

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A loopless algorithm for generating the

A loopless algorithm for generating the permutations of a multiset

✍ Vincent Vajnovszki 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 372 KB

Many combinatorial structures can be constructed from simpler components. For example, a permutation can be constructed from cycles, or a Motzkin word from a Dyck word and a combination. In this paper we present a constructor for combinatorial structures, called shu e on trajectories (deÿned previou

A recognition algorithm for orders of in

A recognition algorithm for orders of interval dimension two

✍ Larry J. Langley 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 500 KB

A parallel algorithm for generating bico

A parallel algorithm for generating bicompatible elimination orderings of proper interval graphs

✍ B.S. Panda; Sajal K. Das 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 182 KB

A comparison of algorithms for minimizin

A comparison of algorithms for minimizing bumps in linear extensions of partial orders

✍ William V. Gehrlein; Peter C. Fishburn 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 526 KB

Interval Algorithms for Finding the Mini

Interval Algorithms for Finding the Minimal Root in a Set of Multiextremal One-Dimensional Nondifferentiable Functions

✍ Casado, L. G.; GarcÍa, I.; Sergeyev, Ya. D. 📂 Article 📅 2002 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 375 KB

A first order logic for specification of

A first order logic for specification of timed algorithms: basic properties and a decidable class

✍ Danièle Beauquier; Anatol Slissenko 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 313 KB