Generating trees on multisets

DOI10.1007/978-3-642-17517-6_18MaRDI QIDQ3060732zbMATH OpenOpenAlexFDO

Authors Bingbing Zhuang, Hiroshi Nagamochi

Publication date 9 December 2010

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-17517-6_18

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Recommendations

• Generation, ranking and unranking of ordered trees with degree bounds
• Efficient generation of plane trees.
• Multiset Permutations and Loopless Generation of Ordered Trees with Specified Degree Sequence
• Constant Time Generation of Free Trees
• Uniform Generation of Rooted Ordered Trees with Prescribed Degrees

Cited in

(2)

• Generating functions for multi-labeled trees
• Generating and enumerating digitally convex sets of trees

This page was built for publication: Generating trees on multisets

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