scientific article; zbMATH DE number 4008409

MaRDI QIDQ3758843zbMATH OpenFDO

Authors Herbert S. Wilf, Nancy A. Yoshimura

Publication date 1986

zbMATH Keywords

algorithmsrankingrooted treesroot-partitions

Mathematics Subject Classification ID

Trees (05C05) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30)

Recommendations

• scientific article; zbMATH DE number 4041938
• scientific article; zbMATH DE number 568846
• Optimal node ranking of tree in linear time
• Ranking and unranking trees using regular reductions
• Ranking and Unranking of Non-regular Trees

Cited in

(11)

• Ranking and Unranking of AVL-Trees
• scientific article; zbMATH DE number 5844196 (Why is no real title available?)
• Algorithms for generalized vertex-rankings of partial k-trees
• Ranking and unranking trees using regular reductions
• Ranking and Unranking of Non-regular Trees
• Applications of antilexicographic order. I: An enumerative theory of trees
• scientific article; zbMATH DE number 4134081 (Why is no real title available?)
• scientific article; zbMATH DE number 4041938 (Why is no real title available?)
• An insertion algorithm and leaders of rooted trees
• Two Algorithms for Unranking Arborescences
• Counting canonical partitions in the random graph

This page was built for publication:

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