The Bounded Path Tree Problem

DOI10.1137/0603048MaRDI QIDQ4750668zbMATH OpenOpenAlexFDO

Authors 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

center of a graphdirected weighted graphshortest path

Mathematics Subject Classification ID

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

Cites work

• A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees
• A note on two problems in connexion with graphs
• Complexity of spanning tree problems: Part I
• scientific article; zbMATH DE number 3643026 (Why is no real title available?)
• scientific article; zbMATH DE number 3847184 (Why is no real title available?)
• scientific article; zbMATH DE number 3503127 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
• Shortest-path problem is not harder than matrix multiplication

Cited in

(4)

• Most and least uniform spanning trees
• On the complexity of finding multi-constrained spanning trees
• Spanning trees with minimum weighted degrees
• Service-constrained network design problems

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

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