The Bounded Path Tree Problem

DOI10.1137/0603048zbMath0512.05037OpenAlexW2064733879MaRDI QIDQ4750668

Giulia Galbiati, Paolo M. Camerini

Publication date: 1982

Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0603048

zbMATH Keywords

shortest pathcenter of a graphdirected weighted graph

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Paths and cycles (05C38)

Related Items (5)

Most and least uniform spanning trees ⋮ Service-constrained network design problems ⋮ Spanning trees with minimum weighted degrees ⋮ On the complexity of finding multi-constrained spanning trees ⋮ Bicriteria Network Design Problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• Complexity of spanning tree problems: Part I
• Shortest-path problem is not harder than matrix multiplication
• A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph

This page was built for publication: The Bounded Path Tree Problem