On finding a minimum spanning tree in a network with random weights

DOI<187::AID-RSA10>3.0.CO;2-6 10.1002/(SICI)1098-2418(199701/03)10:1/2<187::AID-RSA10>3.0.CO;2-6zbMath0872.60008OpenAlexW2024533455MaRDI QIDQ3122913

Could not fetch data.

Publication date: 1 October 1997

Full work available at URL: https://doi.org/10.1002/(sici)1098-2418(199701/03)10:1/2<187::aid-rsa10>3.0.co;2-6

zbMATH Keywords

Could not fetch data.

Mathematics Subject Classification ID

Could not fetch data.