Constant time generation of linear extensions

Authors:
Akimitsu Ono;Shin-ichi Nakano
Affiliations:
Gunma University, Kiryu-Shi, Japan;Gunma University, Kiryu-Shi, Japan
Venue:
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Year:
2005

Citing 12
Cited 1

Efficient algorithms for listing combinatorial structures

Efficient algorithms for listing combinatorial structures
Generating Linear Extensions Fast

SIAM Journal on Computing
A Survey of Combinatorial Gray Codes

SIAM Review
Isomorph-free exhaustive generation

Journal of Algorithms
The advantages of forward thinking in generating rooted and free trees

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
Introduction to Algorithms

Introduction to Algorithms
Efficient generation of plane trees

Information Processing Letters
Efficient Generation of Plane Triangulations without Repetitions

ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Simple Combinatorial Gray Codes Constructed by Reversing Sublists

ISAAC '93 Proceedings of the 4th International Symposium on Algorithms and Computation
Constant Time Generation of Set Partitions

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Handbook of Discrete and Combinatorial Mathematics, Second Edition

Handbook of Discrete and Combinatorial Mathematics, Second Edition

Crossing-Optimal Acyclic Hamiltonian Path Completion and Its Application to Upward Topological Book Embeddings

WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Given a poset $\mathcal{P}$, several algorithms have been proposed for generating all linear extensions of $\mathcal{P}$. The fastest known algorithm generates each linear extension in constant time “on average”. In this paper we give a simple algorithm which generates each linear extension in constant time “in worst case”. The known algorithm generates each linear extension exactly twice and output one of them, while our algorithm generates each linear extension exactly once.