Rooted and unrooted tree-search algorithms

MaRDI QIDQ1422732zbMATH OpenFDO

Authors J. V. Romanovsky, D. Yu. Stukalov

Publication date 25 February 2004

Published in Vestnik St. Petersburg University. Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Generating rooted and free plane trees
• An efficient method of examining all trees
• scientific article; zbMATH DE number 3961006
• scientific article; zbMATH DE number 1305528
• Constant Time Generation of Free Trees

Cited in

(2)

• Enumeration of irredundant forests
• On the rules for the elimination of the non-canonical Morgan trees

This page was built for publication: Rooted and unrooted tree-search algorithms

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