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

DOI10.1016/j.ipl.2009.01.023zbMath1197.05145MaRDI 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 graphs; graph algorithms; total distance

Mathematics Subject Classification ID

68W40: Analysis of algorithms

05C05: Trees

68R10: Graph theory (including graph drawing) in computer science

05C12: Distance in graphs

05C85: Graph algorithms (graph-theoretic aspects)