Performance Oriented Spanning Trees

DOI10.1080/02522667.1995.10699206MaRDI QIDQ4846555zbMATH OpenOpenAlexFDO

Authors Andrew Lim

Publication date 27 August 1995

Published in Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02522667.1995.10699206

zbMATH Keywords

spanning tree

Mathematics Subject Classification ID

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

Recommendations

• Spanning Trees and Optimization Problems
• scientific article; zbMATH DE number 1910742
• Optimum Communication Spanning Trees in Series-Parallel Networks
• A heuristic algorithm for the mini-max spanning forest problem
• Finding minimum congestion spanning trees

Cited in

(6)

• Local heuristics and the emergence of spanning subgraphs in complex networks
• Worst-case performance of Wong's Steiner tree heuristic
• Improving spanning trees by upgrading nodes
• scientific article; zbMATH DE number 742889 (Why is no real title available?)
• An algorithm for the minimum spanning tree with a pivotal point in directed networks
• Finding optimal spanning trees for damaged networks

This page was built for publication: Performance Oriented Spanning Trees

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