A linear time algorithm for finding an optimal degree-bounded subtree of an edge-weighted tree
type: Item
instance of: scholarly article
title: A linear time algorithm for finding an optimal degree-bounded subtree of an edge-weighted tree
zbMATH Open document ID: 1197.05145
author: J. Martínez
published in: Information Processing Letters
publication date: 2010-08-16T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C12
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 5771260
zbMATH Keywords: distance in graphs
zbMATH Keywords: graph algorithms
zbMATH Keywords: total distance
MaRDI profile type: Publication
full work available at URL: j.ipl.2009.01.023
OpenAlex ID: W2094162331
cites work: Finding the \(\ell\)-core of a tree
cites work: Introduction to algorithms
cites work: Q5704408
cites work: The optimal location of a path or tree in a tree network
DOI: 10.1016/J.IPL.2009.01.023
description: scientific article; zbMATH DE number 5771260