Weighted Rooted Trees: Fat or Tall?

DOI10.1007/978-3-030-50026-9_30OpenAlexW3036499108MaRDI QIDQ5042262

Yinfeng Zhu, Yaokun Wu

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

pathDilworth's theoremdown-set

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Submodular functions and rooted trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A branching greedoid for multiply-rooted graphs and digraphs
• Ramsey-type theorems
• A characterization of undirected branching greedoids
• Orthogonal structures in directed graphs
• A note on weighted rooted trees
• A decomposition theorem for partially ordered sets
• The Erdös--Hajnal Conjecture for Long Holes and Antiholes
• Introduction to Greedoids
• Perfect Phylogenies via Branchings in Acyclic Digraphs and a Generalization of Dilworth’s Theorem
• Nombre chromatique et plus longs chemins d'un graphe
• A Dual of Dilworth's Decomposition Theorem

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