scientific article; zbMATH DE number 4008409

zbMATH Open0622.05016MaRDI QIDQ3758843FDOQ3758843

Authors: Herbert S. Wilf, Nancy A. Yoshimura 

Publication date: 1986

Title of this publication is not available (Why is that?)

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

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)

Cited In (11)

• Ranking and Unranking of AVL-Trees
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• Title not available (Why is that?)
• Two Algorithms for Unranking Arborescences
• An insertion algorithm and leaders of rooted trees
• 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)