A linear time algorithm for finding an optimal degree-bounded subtree of an edge-weighted tree

DOI10.1016/j.ipl.2009.01.023zbMath1197.05145OpenAlexW2094162331MaRDI QIDQ987822

J. Martínez

Publication date: 16 August 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2009.01.023

zbMATH Keywords

distance in graphsgraph algorithmstotal distance

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Unnamed Item
• Finding the \(\ell\)-core of a tree
• The optimal location of a path or tree in a tree network