Generating Linear Extensions Fast
From MaRDI portal
Publication:4291563
DOI10.1137/S0097539791202647zbMath0804.68055WikidataQ56534623 ScholiaQ56534623MaRDI QIDQ4291563
Publication date: 22 January 1995
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Partial orders, general (06A06) Parallel algorithms in computer science (68W10) Total orders (06A05) Eulerian and Hamiltonian graphs (05C45)
Related Items
Generating and characterizing the perfect elimination orderings of a chordal graph, Tight performance bounds in the worst-case analysis of feed-forward networks, Badness of Serial Fit Revisited, Reverse search for enumeration, A loop-free algorithm for generating the linear extensions of a poset, On enumerating monomials and other combinatorial structures by polynomial interpolation, Weak-order extensions of an order., A combinatorial study of async/await processes, Evolution on distributive lattices, Binary bubble languages and cool-lex order, Applying relation algebra and RelView to solve problems on orders and lattices, Enumerating models of DNF faster: breaking the dependency on the formula size, On the restricted cores and the bounded core of games on distributive lattices, Efficient algorithms on distributive lattices, On extensions, linear extensions, upsets and downsets of ordered sets, Bottom-up: a new algorithm to generate random linear extensions of a poset, Crossing-Optimal Acyclic Hamiltonian Path Completion and Its Application to Upward Topological Book Embeddings, Applying Young diagrams to 2-symmetric fuzzy measures with an application to general fuzzy measures, A CAT algorithm for generating permutations with a fixed number of inversions, Gray code enumeration of families of integer partitions, Extensions of the prudence principle to exploit a valued outranking relation, Oracles for vertex elimination orderings, The connectivity of acyclic orientation graphs, Faster random generation of linear extensions, FUSING LOOPLESS ALGORITHMS FOR COMBINATORIAL GENERATION, Minimal change list for Lucas strings and some graph theoretic consequences, Gray codes from antimatroids, MINING POSETS FROM LINEAR ORDERS, Inferring a possibility distribution from empirical data, Unnamed Item
