Family Trees for Enumeration

DOI10.1142/s0129054123420078zbMath1526.05068OpenAlexW4381164141MaRDI QIDQ6087777

Shin-ichi Nakano

Publication date: 16 November 2023

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054123420078

zbMATH Keywords

algorithmenumerationreverse search

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient enumeration of ordered trees with \(k\) leaves
• Efficient generation of triconnected plane triangulations.
• Floorplans with columns
• Generating rooted triangulations without repetitions
• Efficient generation of plane trees.
• Reverse search for enumeration
• Floorplans with walls
• Generating All Triangulations of Plane Graphs
• Listing All Plane Graphs
• Fundamentals of Computation Theory
• Graph-Theoretic Concepts in Computer Science

This page was built for publication: Family Trees for Enumeration