Constant time enumeration of weighted trees

DOI10.1016/J.DAM.2025.05.043MaRDI QIDQ6950395zbMATH OpenFDO

Authors Mengze Qian, Ryuhei Uehara

Publication date 31 July 2025

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DAM.2025.05.043

zbMATH Keywords

reverse searchrooted treetree enumerationvertex-weighted tree

Mathematics Subject Classification ID

Trees (05C05) Signed and weighted graphs (05C22) Enumeration in graph theory (05C30) Graph theory (including graph drawing) in computer science (68R10)

Cites work

• A loopless Gray code for rooted trees
• An algorithm for the blocks and cutnodes of a graph
• Block cutpoint decomposition for markovian queueing systems
• Constant Time Generation of Free Trees
• Constant Time Generation of Rooted Trees
• Efficient enumeration of non-isomorphic distance-hereditary graphs and Ptolemaic graphs
• Efficient generation of plane trees.
• Enumeration of BC-subtrees of trees
• Enumeration of nonisomorphic interval graphs and nonisomorphic permutation graphs
• Graph-Theoretic Concepts in Computer Science
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• scientific article; zbMATH DE number 7646025 (Why is no real title available?)
• Recognizing some subclasses of vertex intersection graphs of 0-bend paths in a grid
• Reverse search for enumeration

Cited in

(1)

• Exact counting of subtrees with diameter no more than d in trees: a generating function approach

This page was built for publication: Constant time enumeration of weighted trees

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