%0 Journal Article %1 journals/orl/RyanS22 %A Ryan, Christopher Thomas %A Smith, Robert L. %D 2022 %J Oper. Res. Lett. %K dblp %N 6 %P 655-659 %T A greedy algorithm for finding maximum spanning trees in infinite graphs. %U http://dblp.uni-trier.de/db/journals/orl/orl50.html#RyanS22 %V 50

@article{journals/orl/RyanS22, added-at = {2023-01-06T00:00:00.000+0100}, author = {Ryan, Christopher Thomas and Smith, Robert L.}, biburl = {https://www.bibsonomy.org/bibtex/2cb40539159111b48712171afee5783d9/dblp}, ee = {https://doi.org/10.1016/j.orl.2022.10.004}, interhash = {11c21655404ad3c8b5625b41f48f14e3}, intrahash = {cb40539159111b48712171afee5783d9}, journal = {Oper. Res. Lett.}, keywords = {dblp}, number = 6, pages = {655-659}, timestamp = {2024-04-08T18:59:59.000+0200}, title = {A greedy algorithm for finding maximum spanning trees in infinite graphs.}, url = {http://dblp.uni-trier.de/db/journals/orl/orl50.html#RyanS22}, volume = 50, year = 2022 }