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

DOI10.1016/J.IPL.2009.01.023MaRDI QIDQ987822zbMATH OpenOpenAlexFDO

Authors 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

graph algorithmsdistance in graphstotal distance

Mathematics Subject Classification ID

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

Recommendations

• Enumeration of subtrees of trees
• An improved algorithm for finding a length-constrained maximum-density subtree in a tree
• The Weighted Maximum-Mean Subtree and Other Bicriterion Subtree Problems
• Efficient algorithms for a constrained k-tree core problem in a tree network

Cites work

• scientific article; zbMATH DE number 2229025 (Why is no real title available?)
• Finding the \(\ell\)-core of a tree
• Introduction to algorithms
• The optimal location of a path or tree in a tree network

Cited in

(6)

• An optimal time algorithm for finding a maximum weight independent set in a tree
• Enumeration of subtrees of trees
• Find subtrees of specified weight and cycles of specified length in linear time
• An improved algorithm for finding a length-constrained maximum-density subtree in a tree
• scientific article; zbMATH DE number 1522948 (Why is no real title available?)
• A linear time and space algorithm for finding isomorphic subtrees of a binary tree

This page was built for publication: A linear time algorithm for finding an optimal degree-bounded subtree of an edge-weighted tree

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