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

From MaRDI portal
Publication:3122913

DOI10.1002/(SICI)1098-2418(199701/03)10:1/2%3C187::AID-RSA10%3E3.0.CO;2-6zbMATH Open0872.60008OpenAlexW2024533455MaRDI QIDQ3122913FDOQ3122913

Harold S. Stone, Colin McDiarmid, Theodore Johnson

Publication date: 1 October 1997


Full work available at URL: https://doi.org/10.1002/(sici)1098-2418(199701/03)10:1/2%3C187::aid-rsa10%3E3.0.co;2-6





Cites Work


Cited In (9)


Recommendations





This page was built for publication: On finding a minimum spanning tree in a network with random weights

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