Weighted Rooted Trees: Fat or Tall?

DOI10.1007/978-3-030-50026-9_30MaRDI QIDQ5042262zbMATH OpenOpenAlexFDO

Authors Yaokun Wu, Yinfeng Zhu

Publication date 19 October 2022

Published in Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-50026-9_30

zbMATH Keywords

Dilworth's theoremdown-setpath

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Trees with power-like height dependent weight
• scientific article; zbMATH DE number 3862455
• Weighted height of random trees
• Trees with exponential height dependent weight
• Total Weight Choosability of Trees
• A note on weighted rooted trees
• Balancing weight-balanced trees
• Optimal weight allocation in rooted trees
• On weighted heights of random trees

Cites work

• A branching greedoid for multiply-rooted graphs and digraphs
• A characterization of undirected branching greedoids
• A decomposition theorem for partially ordered sets
• A Dual of Dilworth's Decomposition Theorem
• A note on weighted rooted trees
• scientific article; zbMATH DE number 3165195 (Why is no real title available?)
• scientific article; zbMATH DE number 1889798 (Why is no real title available?)
• scientific article; zbMATH DE number 3257176 (Why is no real title available?)
• Introduction to Greedoids
• Nombre chromatique et plus longs chemins d'un graphe
• Orthogonal structures in directed graphs
• Perfect phylogenies via branchings in acyclic digraphs and a generalization of Dilworth's theorem
• Ramsey-type theorems
• The Erdős-Hajnal conjecture for long holes and antiholes

Cited in

(1)

• Submodular functions and rooted trees

This page was built for publication: Weighted Rooted Trees: Fat or Tall?

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