[Lecture Notes in Computer Science] Algorithms and Complexity Volume 2653 || Generating All Forest Extensions of a Partially Ordered Set
β Scribed by Petreschi, Rossella; Persiano, Giuseppe; Silvestri, Riccardo
- Book ID
- 120581436
- Publisher
- Springer Berlin Heidelberg
- Year
- 2003
- Weight
- 144 KB
- Category
- Article
- ISBN
- 3540448497
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
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
This book constitutes the refereed proceedings of the 8th International Workshop on Algorithms and Data Structures, WADS 2003, held in Ottawa, Ontario, Canada, in July/August 2003. The 40 revised full papers presented together with 4 invited papers were carefully reviewed and selected from 126 subm
This book constitutes the refereed proceedings of the 6th International Conference, FUN 2012, held in June 2012 in Venice, Italy. The 34 revised full papers were carefully reviewed and selected from 56 submissions. They feature a large variety of topics in the field of the use, design, and analysis