Family Trees for Enumeration

DOI10.1142/S0129054123420078MaRDI QIDQ6087777zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Efficient generation of plane trees.
• Efficient enumeration of ordered trees with \(k\) leaves
• Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract)
• scientific article; zbMATH DE number 1305528
• Generating Linear Extensions Fast

Cites work

• Efficient enumeration of ordered trees with \(k\) leaves
• Efficient generation of plane trees.
• Efficient generation of triconnected plane triangulations.
• Floorplans with columns
• Floorplans with walls
• Fundamentals of Computation Theory
• Generating all triangulations of plane graphs
• Generating rooted triangulations without repetitions
• Graph-Theoretic Concepts in Computer Science
• scientific article; zbMATH DE number 3575612 (Why is no real title available?)
• scientific article; zbMATH DE number 2080983 (Why is no real title available?)
• scientific article; zbMATH DE number 1754610 (Why is no real title available?)
• Listing All Plane Graphs
• Reverse search for enumeration

Cited in

(3)

• Enumeration of irredundant forests
• Information Measures for Some Well-Known Families
• A Gray code of ordered trees

This page was built for publication: Family Trees for Enumeration

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6087777)