Efficient enumeration of all ladder lotteries and its application

DOI10.1016/j.tcs.2010.01.002zbMath1191.68456OpenAlexW2092899727WikidataQ60692283 ScholiaQ60692283MaRDI QIDQ964388

Yasuko Matsui, Katsuhisa Yamanaka, Ryuhei Uehara, Kento Nakada, Shin-ichi Nakano

Publication date: 15 April 2010

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2010.01.002

zbMATH Keywords

pseudoline arrangementenumeration algorithmfamily treeladder lottery

Mathematics Subject Classification ID

Combinatorics in computer science (68R05)

Related Items

Enumeration, Counting, and Random Generation of Ladder Lotteries ⋮ Sorting balls and water: equivalence and computational complexity ⋮ The Bundled Crossing Number ⋮ Reconfiguration and enumeration of optimal cyclic ladder lotteries ⋮ Optimal reconfiguration of optimal ladder lotteries ⋮ Simplicial arrangements with up to 27 lines ⋮ Swapping labeled tokens on graphs

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Random tilings of high symmetry. I: Mean-field theory
• Proof of a conjecture of Burr, Grünbaum, and Sloane
• Axioms and hulls
• Efficient generation of triconnected plane triangulations.
• On the fully commutative elements of Coxeter groups
• Reverse search for enumeration
• Bemerkungen zum Vierfarbenproblem
• Listing All Plane Graphs
• Graph-Theoretic Concepts in Computer Science