Finding optimal spanning trees for damaged networks

DOI10.61091/jcmcc121-07MaRDI QIDQ6586647zbMATH OpenFDO

Authors John Raymond Hamilton, Hossein Shahmohamad

Publication date 13 August 2024

Published in JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.61091/jcmcc121-07

zbMATH Keywords

minimum spanning trees

Mathematics Subject Classification ID

Trees (05C05) Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Recommendations

• Spanning trees and hierarchical networks
• A solution of Chartrand's problem on spanning trees
• Performance Oriented Spanning Trees
• scientific article; zbMATH DE number 3966094
• Edge‐disjoint spanning trees: A connectedness theorem

Cites work

• An in-depth empirical investigation of non-greedy approaches for the minimum spanning tree problem
• Bibliography on Algorithms for Shortest Path, Shortest Spanning Tree, and Related Circuit Routing Problems (1956–1974)
• Computational Methods for Minimum Spanning Tree Algorithms
• scientific article; zbMATH DE number 6506585 (Why is no real title available?)
• scientific article; zbMATH DE number 3445271 (Why is no real title available?)
• On the History of the Minimum Spanning Tree Problem

This page was built for publication: Finding optimal spanning trees for damaged networks

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