Barros, Bruno José S.; Ochi, Luiz Satoru; Pinheiro, Rian Gabriel S.; Souza, Uéverton S. On conflict-free spanning tree: algorithms and complexity. (English) Zbl 07683165 Balachandran, Niranjan (ed.) et al., Algorithms and discrete applied mathematics. 8th international conference, CALDAM 2022, Puducherry, India, February 10–12, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13179, 91-102 (2022). MSC: 68Wxx PDF BibTeX XML Cite \textit{B. J. S. Barros} et al., Lect. Notes Comput. Sci. 13179, 91--102 (2022; Zbl 07683165) Full Text: DOI OpenURL
Ryan, Christopher Thomas; Smith, Robert L. A greedy algorithm for finding maximum spanning trees in infinite graphs. (English) Zbl 07631931 Oper. Res. Lett. 50, No. 6, 655-659 (2022). MSC: 90-XX PDF BibTeX XML Cite \textit{C. T. Ryan} and \textit{R. L. Smith}, Oper. Res. Lett. 50, No. 6, 655--659 (2022; Zbl 07631931) Full Text: DOI OpenURL
Chen, Min-Jen; Chao, Kun-Mao Proof of a conjecture about minimum spanning tree cycle intersection. (English) Zbl 1497.05035 Discrete Appl. Math. 321, 19-23 (2022). MSC: 05C05 05C35 05C38 PDF BibTeX XML Cite \textit{M.-J. Chen} and \textit{K.-M. Chao}, Discrete Appl. Math. 321, 19--23 (2022; Zbl 1497.05035) Full Text: DOI OpenURL
Böhm, Martin; Hoeksma, Ruben; Megow, Nicole; Nölke, Lukas; Simon, Bertrand On hop-constrained Steiner trees in tree-like metrics. (English) Zbl 07537556 SIAM J. Discrete Math. 36, No. 2, 1249-1273 (2022). MSC: 68Q25 90C27 05C12 PDF BibTeX XML Cite \textit{M. Böhm} et al., SIAM J. Discrete Math. 36, No. 2, 1249--1273 (2022; Zbl 07537556) Full Text: DOI arXiv OpenURL
Wei, Ningji; Walteros, Jose L.; Pajouh, Foad Mahdavi Integer programming formulations for minimum spanning tree interdiction. (English) Zbl 07549345 INFORMS J. Comput. 33, No. 4, 1461-1480 (2021). MSC: 90-XX PDF BibTeX XML Cite \textit{N. Wei} et al., INFORMS J. Comput. 33, No. 4, 1461--1480 (2021; Zbl 07549345) Full Text: DOI OpenURL
Balcı, Mehmet Ali; Akgüller, Ömer; Can Güzel, Serdar Hierarchies in communities of UK stock market from the perspective of Brexit. (English) Zbl 07484673 J. Appl. Stat. 48, No. 13-15, 2607-2625 (2021). MSC: 62Pxx PDF BibTeX XML Cite \textit{M. A. Balcı} et al., J. Appl. Stat. 48, No. 13--15, 2607--2625 (2021; Zbl 07484673) Full Text: DOI OpenURL
Li, Ming; Liu, Run-Ran; Lü, Linyuan; Hu, Mao-Bin; Xu, Shuqi; Zhang, Yi-Cheng Percolation on complex networks: theory and application. (English) Zbl 1484.82049 Phys. Rep. 907, 1-68 (2021). MSC: 82C43 82C26 82C27 05C82 60K35 PDF BibTeX XML Cite \textit{M. Li} et al., Phys. Rep. 907, 1--68 (2021; Zbl 1484.82049) Full Text: DOI arXiv OpenURL
Balcı, Mehmet Ali Fractional interaction of financial agents in a stock market network. (English) Zbl 07664139 Appl. Math. Nonlinear Sci. 5, No. 1, 317-336 (2020). MSC: 91G45 05C82 26A33 62P05 PDF BibTeX XML Cite \textit{M. A. Balcı}, Appl. Math. Nonlinear Sci. 5, No. 1, 317--336 (2020; Zbl 07664139) Full Text: DOI OpenURL
Andersen, Patrick J.; Ras, Charl J. Degree bounded bottleneck spanning trees in three dimensions. (English) Zbl 1439.90058 J. Comb. Optim. 39, No. 2, 457-491 (2020). MSC: 90C27 90C59 PDF BibTeX XML Cite \textit{P. J. Andersen} and \textit{C. J. Ras}, J. Comb. Optim. 39, No. 2, 457--491 (2020; Zbl 1439.90058) Full Text: DOI arXiv OpenURL
Nedělková, Zuzana; Cromvik, Christoffer; Lindroth, Peter; Patriksson, Michael; Strömberg, Ann-Brith A splitting algorithm for simulation-based optimization problems with categorical variables. (English) Zbl 07637017 Eng. Optim. 51, No. 5, 815-831 (2019). MSC: 90-XX PDF BibTeX XML Cite \textit{Z. Nedělková} et al., Eng. Optim. 51, No. 5, 815--831 (2019; Zbl 07637017) Full Text: DOI OpenURL
Halder, Yous V.; Sanderse, Benjamin; Koren, Barry An adaptive minimum spanning tree multielement method for uncertainty quantification of smooth and discontinuous responses. (English) Zbl 1447.65100 SIAM J. Sci. Comput. 41, No. 6, A3624-A3648 (2019). Reviewer: Temur A. Jangveladze (Tbilisi) MSC: 65M70 68Q32 65M55 65D05 65N25 05C05 PDF BibTeX XML Cite \textit{Y. V. Halder} et al., SIAM J. Sci. Comput. 41, No. 6, A3624--A3648 (2019; Zbl 1447.65100) Full Text: DOI arXiv OpenURL
Andersen, Patrick J.; Ras, Charl J. Algorithms for Euclidean degree bounded spanning tree problems. (English) Zbl 1430.68353 Int. J. Comput. Geom. Appl. 29, No. 2, 121-160 (2019). MSC: 68U05 90C27 90C59 PDF BibTeX XML Cite \textit{P. J. Andersen} and \textit{C. J. Ras}, Int. J. Comput. Geom. Appl. 29, No. 2, 121--160 (2019; Zbl 1430.68353) Full Text: DOI arXiv OpenURL
Conte, Alessio; Grossi, Roberto; Marino, Andrea; Rizzi, Romeo; Versari, Luca Listing subgraphs by Cartesian decomposition. (English) Zbl 07378401 Potapov, Igor (ed.) et al., 43rd international symposium on mathematical foundations of computer science. MFCS 2018, Liverpool, United Kingdom, August 27–31, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 117, Article 84, 16 p. (2018). MSC: 68Qxx PDF BibTeX XML Cite \textit{A. Conte} et al., LIPIcs -- Leibniz Int. Proc. Inform. 117, Article 84, 16 p. (2018; Zbl 07378401) Full Text: DOI OpenURL
Hefetz, Dan; Kupferman, Orna; Lellouche, Amir; Vardi, Gal Spanning-tree games. (English) Zbl 07378352 Potapov, Igor (ed.) et al., 43rd international symposium on mathematical foundations of computer science. MFCS 2018, Liverpool, United Kingdom, August 27–31, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 117, Article 35, 16 p. (2018). MSC: 68Qxx PDF BibTeX XML Cite \textit{D. Hefetz} et al., LIPIcs -- Leibniz Int. Proc. Inform. 117, Article 35, 16 p. (2018; Zbl 07378352) Full Text: DOI OpenURL
Garban, Christophe; Pete, Gábor; Schramm, Oded The scaling limits of the minimal spanning tree and invasion percolation in the plane. (English) Zbl 1426.60117 Ann. Probab. 46, No. 6, 3501-3557 (2018). MSC: 60K35 82B27 82B43 05C05 60D05 81T27 81T40 PDF BibTeX XML Cite \textit{C. Garban} et al., Ann. Probab. 46, No. 6, 3501--3557 (2018; Zbl 1426.60117) Full Text: DOI arXiv Euclid OpenURL
Guttmann, Walter An algebraic framework for minimum spanning tree problems. (English) Zbl 1401.68246 Theor. Comput. Sci. 744, 37-55 (2018). MSC: 68R10 05C22 05C85 68T15 PDF BibTeX XML Cite \textit{W. Guttmann}, Theor. Comput. Sci. 744, 37--55 (2018; Zbl 1401.68246) Full Text: DOI OpenURL
Santos, J. L.; Di Puglia Pugliese, Luigi; Guerriero, Francesca A new approach for the multiobjective minimum spanning tree. (English) Zbl 1391.90618 Comput. Oper. Res. 98, 69-83 (2018). MSC: 90C35 90C29 68R10 90C60 90C27 PDF BibTeX XML Cite \textit{J. L. Santos} et al., Comput. Oper. Res. 98, 69--83 (2018; Zbl 1391.90618) Full Text: DOI OpenURL
Kırlar, Barış Bülent; Ergün, Serap; Alparslan Gök, Sırma Zeynep; Weber, Gerhard-Wilhelm A game-theoretical and cryptographical approach to crypto-cloud computing and its economical and financial aspects. (English) Zbl 1404.91065 Ann. Oper. Res. 260, No. 1-2, 217-231 (2018). MSC: 91A80 91A12 94A60 68M11 91G99 91B99 91-04 PDF BibTeX XML Cite \textit{B. B. Kırlar} et al., Ann. Oper. Res. 260, No. 1--2, 217--231 (2018; Zbl 1404.91065) Full Text: DOI OpenURL
Sadhukhan, Payel; Murthy, C. A. Multi-label learning through minimum spanning tree-based subset selection and feature extraction. (English) Zbl 1454.68130 Mouhoub, Malek (ed.) et al., Advances in artificial intelligence. 30th Canadian conference on artificial intelligence, Canadian AI 2017, Edmonton, AB, Canada, May 16–19, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10233, 90-96 (2017). MSC: 68T05 62H30 PDF BibTeX XML Cite \textit{P. Sadhukhan} and \textit{C. A. Murthy}, Lect. Notes Comput. Sci. 10233, 90--96 (2017; Zbl 1454.68130) Full Text: DOI OpenURL
Turkensteen, Marcel; Malyshev, Dmitry; Goldengorin, Boris; Pardalos, Panos M. The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems. (English) Zbl 1377.90081 J. Glob. Optim. 68, No. 3, 601-622 (2017). MSC: 90C27 90C59 PDF BibTeX XML Cite \textit{M. Turkensteen} et al., J. Glob. Optim. 68, No. 3, 601--622 (2017; Zbl 1377.90081) Full Text: DOI OpenURL
Houndji, Vinasetan Ratheil; Schaus, Pierre; Hounkonnou, Mahouton Norbert; Wolsey, Laurence The weighted arborescence constraint. (English) Zbl 1489.68194 Salvagnin, Domenico (ed.) et al., Integration of AI and OR techniques in constraint programming. 14th international conference, CPAIOR 2017, Padua, Italy, June 5–8, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10335, 185-201 (2017). MSC: 68R10 68T20 PDF BibTeX XML Cite \textit{V. R. Houndji} et al., Lect. Notes Comput. Sci. 10335, 185--201 (2017; Zbl 1489.68194) Full Text: DOI OpenURL
Gao, Xiulian Tree index of uncertain graphs. (English) Zbl 1370.68271 Soft Comput. 20, No. 4, 1449-1458 (2016). MSC: 68T37 05C72 PDF BibTeX XML Cite \textit{X. Gao}, Soft Comput. 20, No. 4, 1449--1458 (2016; Zbl 1370.68271) Full Text: DOI OpenURL
Rey, David; Gardner, Lauren; Waller, S. Travis Finding outbreak trees in networks with limited information. (English) Zbl 1365.92130 Netw. Spat. Econ. 16, No. 2, 687-721 (2016). MSC: 92D30 91D30 90C10 90C35 PDF BibTeX XML Cite \textit{D. Rey} et al., Netw. Spat. Econ. 16, No. 2, 687--721 (2016; Zbl 1365.92130) Full Text: DOI OpenURL
Dorrigiv, Reza; Fraser, Robert; He, Meng; Kamali, Shahin; Kawamura, Akitoshi; López-Ortiz, Alejandro; Seco, Diego On minimum- and maximum-weight minimum spanning trees with neighborhoods. (English) Zbl 1328.68261 Theory Comput. Syst. 56, No. 1, 220-250 (2015). MSC: 68U05 68R10 PDF BibTeX XML Cite \textit{R. Dorrigiv} et al., Theory Comput. Syst. 56, No. 1, 220--250 (2015; Zbl 1328.68261) Full Text: DOI OpenURL
Kor, Liah; Korman, Amos; Peleg, David Tight bounds for distributed minimum-weight spanning tree verification. (English) Zbl 1286.68317 Theory Comput. Syst. 53, No. 2, 318-340 (2013). MSC: 68Q60 68W15 68Q17 68R10 PDF BibTeX XML Cite \textit{L. Kor} et al., Theory Comput. Syst. 53, No. 2, 318--340 (2013; Zbl 1286.68317) Full Text: DOI arXiv OpenURL
Bollig, Beate On symbolic OBDD-based algorithms for the minimum spanning tree problem. (English) Zbl 1245.05125 Theor. Comput. Sci. 447, 2-12 (2012). MSC: 05C85 05C05 68R10 68P05 PDF BibTeX XML Cite \textit{B. Bollig}, Theor. Comput. Sci. 447, 2--12 (2012; Zbl 1245.05125) Full Text: DOI OpenURL
Moretti, Stefano; Alparslan Gök, S. Zeynep; Branzei, Rodica; Tijs, Stef Connection situations under uncertainty and cost monotonic solutions. (English) Zbl 1210.90046 Comput. Oper. Res. 38, No. 11, 1638-1645 (2011). MSC: 90B18 90B10 PDF BibTeX XML Cite \textit{S. Moretti} et al., Comput. Oper. Res. 38, No. 11, 1638--1645 (2011; Zbl 1210.90046) Full Text: DOI Link OpenURL
Aldous, David J.; Shun, Julian Connected spatial networks over random points and a route-length statistic. (English) Zbl 1329.60009 Stat. Sci. 25, No. 3, 275-288 (2010). MSC: 60D05 60G55 05C80 62M30 05C82 PDF BibTeX XML Cite \textit{D. J. Aldous} and \textit{J. Shun}, Stat. Sci. 25, No. 3, 275--288 (2010; Zbl 1329.60009) Full Text: DOI arXiv Euclid OpenURL
Addario-Berry, L.; Broutin, N.; Reed, B. Critical random graphs and the structure of a minimum spanning tree. (English) Zbl 1214.05154 Random Struct. Algorithms 35, No. 3, 323-347 (2009). MSC: 05C80 05C35 05C05 PDF BibTeX XML Cite \textit{L. Addario-Berry} et al., Random Struct. Algorithms 35, No. 3, 323--347 (2009; Zbl 1214.05154) Full Text: DOI OpenURL
Alonso, Sergio; Domínguez-Ríos, Miguel Ángel; Colebrook, Marcos; Sedeño-Noda, Antonio Optimality conditions in preference-based spanning tree problems. (English) Zbl 1163.90791 Eur. J. Oper. Res. 198, No. 1, 232-240 (2009). MSC: 90C46 PDF BibTeX XML Cite \textit{S. Alonso} et al., Eur. J. Oper. Res. 198, No. 1, 232--240 (2009; Zbl 1163.90791) Full Text: DOI OpenURL
Mareš, Martin The saga of minimum spanning trees. (English) Zbl 1302.68219 Comput. Sci. Rev. 2, No. 3, 165-221 (2008). MSC: 68R10 05C85 05C05 68Q25 68W05 68-02 PDF BibTeX XML Cite \textit{M. Mareš}, Comput. Sci. Rev. 2, No. 3, 165--221 (2008; Zbl 1302.68219) Full Text: DOI OpenURL
Steiner, Sarah; Radzik, Tomasz Computing all efficient solutions of the biobjective minimum spanning tree problem. (English) Zbl 1149.90403 Comput. Oper. Res. 35, No. 1, 198-211 (2008). MSC: 90C29 90C27 PDF BibTeX XML Cite \textit{S. Steiner} and \textit{T. Radzik}, Comput. Oper. Res. 35, No. 1, 198--211 (2008; Zbl 1149.90403) Full Text: DOI OpenURL
Milková, Eva The minimum spanning tree problem: Jarník’s solution in historical and present context. (English) Zbl 1291.05102 Hliněný, Petr (ed.) et al., 6th Czech-Slovak international symposium on combinatorics, graph theory, algorithms and applications, DIMATIA Center, Charles University, Prague, Czech Republic, July 10–16, 2006. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 28, 309-316 (2007). MSC: 05C35 05C05 68R10 68P10 PDF BibTeX XML Cite \textit{E. Milková}, Electron. Notes Discrete Math. 28, 309--316 (2007; Zbl 1291.05102) Full Text: DOI OpenURL
Lin, Chung-Ming; Tsai, Yin Te; Tang, Chuan Yi Balancing minimum spanning trees and multiple-source minimum routing cost spanning trees on metric graphs. (English) Zbl 1184.05125 Inf. Process. Lett. 99, No. 2, 64-67 (2006). MSC: 05C85 05C05 68M10 PDF BibTeX XML Cite \textit{C.-M. Lin} et al., Inf. Process. Lett. 99, No. 2, 64--67 (2006; Zbl 1184.05125) Full Text: DOI OpenURL
Carmi, Paz; Katz, Matthew J.; Mitchell, Joseph S. B. The minimum-area spanning tree problem. (English) Zbl 1102.65020 Comput. Geom. 35, No. 3, 218-225 (2006). MSC: 65D18 65K05 PDF BibTeX XML Cite \textit{P. Carmi} et al., Comput. Geom. 35, No. 3, 218--225 (2006; Zbl 1102.65020) Full Text: DOI OpenURL
Haouari, Mohamed; Chaouachi, Jouhaina Siala Upper and lower bounding strategies for the generalized minimum spanning tree problem. (English) Zbl 1090.90163 Eur. J. Oper. Res. 171, No. 2, 632-647 (2006). MSC: 90C27 90C59 PDF BibTeX XML Cite \textit{M. Haouari} and \textit{J. S. Chaouachi}, Eur. J. Oper. Res. 171, No. 2, 632--647 (2006; Zbl 1090.90163) Full Text: DOI OpenURL
Dutta, Bhaskar; Kar, Anirban Cost monotonicity, consistency and minimum cost spanning tree games. (English) Zbl 1117.91308 Games Econ. Behav. 48, No. 2, 223-248 (2004). MSC: 91A12 91B32 PDF BibTeX XML Cite \textit{B. Dutta} and \textit{A. Kar}, Games Econ. Behav. 48, No. 2, 223--248 (2004; Zbl 1117.91308) Full Text: DOI Link OpenURL
Kar, Anirban Axiomatization of the Shapley value on minimum cost spanning tree games. (English) Zbl 1035.91007 Games Econ. Behav. 38, No. 2, 265-277 (2002). Reviewer: Salvatore Modica (Palermo) MSC: 91A12 91A43 PDF BibTeX XML Cite \textit{A. Kar}, Games Econ. Behav. 38, No. 2, 265--277 (2002; Zbl 1035.91007) Full Text: DOI OpenURL
Bazlamaçci, Cüneyt F.; Hindi, Khalil S. Minimum-weight spanning tree algorithms. A survey and empirical study. (English) Zbl 1018.90062 Comput. Oper. Res. 28, No. 8, 767-785 (2001). MSC: 90C35 90C27 90-02 PDF BibTeX XML Cite \textit{C. F. Bazlamaçci} and \textit{K. S. Hindi}, Comput. Oper. Res. 28, No. 8, 767--785 (2001; Zbl 1018.90062) Full Text: DOI OpenURL
Cieslik, Dietmar The vertex degrees of minimum spanning trees. (English) Zbl 0952.90041 Eur. J. Oper. Res. 125, No. 2, 278-282 (2000). MSC: 90C35 05C90 PDF BibTeX XML Cite \textit{D. Cieslik}, Eur. J. Oper. Res. 125, No. 2, 278--282 (2000; Zbl 0952.90041) Full Text: DOI OpenURL
Ramos, R. M.; Alonso Rodríguez, Sergio Fernando; Sicilia Rodríguez, Joaquín; González Martín, Carlos The problem of the optimal biobjective spanning tree. (English) Zbl 0937.90112 Eur. J. Oper. Res. 111, No. 3, 617-628 (1998). MSC: 90C35 90C29 PDF BibTeX XML Cite \textit{R. M. Ramos} et al., Eur. J. Oper. Res. 111, No. 3, 617--628 (1998; Zbl 0937.90112) Full Text: DOI OpenURL
Zhou, Gengui; Gen, Mitsuo An effective genetic algorithm approach to the quadratic minimum spanning tree problem. (English) Zbl 0904.90169 Comput. Oper. Res. 25, No. 3, 229-237 (1998). MSC: 90C35 68T05 PDF BibTeX XML Cite \textit{G. Zhou} and \textit{M. Gen}, Comput. Oper. Res. 25, No. 3, 229--237 (1998; Zbl 0904.90169) Full Text: DOI OpenURL
Gordon, A. D. A survey of constrained classification. (English) Zbl 0900.62313 Comput. Stat. Data Anal. 21, No. 1, 17-29 (1996). MSC: 62H30 PDF BibTeX XML Cite \textit{A. D. Gordon}, Comput. Stat. Data Anal. 21, No. 1, 17--29 (1996; Zbl 0900.62313) Full Text: DOI OpenURL
Cieslik, Dietmar; Linhart, Johann Steiner minimal trees in \(L^ 2_ p\). (English) Zbl 0863.05026 Discrete Math. 155, No. 1-3, 39-48 (1996). Reviewer: Du Ding-Zhu (Minneapolis) MSC: 05C05 PDF BibTeX XML Cite \textit{D. Cieslik} and \textit{J. Linhart}, Discrete Math. 155, No. 1--3, 39--48 (1996; Zbl 0863.05026) Full Text: DOI OpenURL
Yamada, Takeo; Takahashi, Hideo; Kataoka, Seiji A heuristic algorithm for the mini-max spanning forest problem. (English) Zbl 0918.90135 Eur. J. Oper. Res. 91, No. 3, 565-572 (1996). MSC: 90C35 PDF BibTeX XML Cite \textit{T. Yamada} et al., Eur. J. Oper. Res. 91, No. 3, 565--572 (1996; Zbl 0918.90135) Full Text: DOI OpenURL
Robins, G.; Salowe, J. S. Low-degree minimum spanning trees. (English) Zbl 0827.05020 Discrete Comput. Geom. 14, No. 2, 151-165 (1995). Reviewer: D.Cieslik (Greifswald) MSC: 05C05 52C17 PDF BibTeX XML Cite \textit{G. Robins} and \textit{J. S. Salowe}, Discrete Comput. Geom. 14, No. 2, 151--165 (1995; Zbl 0827.05020) Full Text: DOI EuDML OpenURL
Glover, F.; Klingman, D.; Krishnan, R.; Padman, R. An in-depth empirical investigation of non-greedy approaches for the minimum spanning tree problem. (English) Zbl 0760.90088 Eur. J. Oper. Res. 56, No. 3, 343-356 (1992). MSC: 90C35 90-08 PDF BibTeX XML Cite \textit{F. Glover} et al., Eur. J. Oper. Res. 56, No. 3, 343--356 (1992; Zbl 0760.90088) Full Text: DOI OpenURL
Bollobás, Béla; Meir, A. A travelling salesman problem in the \(k\)-dimensional unit cube. (English) Zbl 0773.90080 Oper. Res. Lett. 11, No. 1, 19-21 (1992). MSC: 90C35 PDF BibTeX XML Cite \textit{B. Bollobás} and \textit{A. Meir}, Oper. Res. Lett. 11, No. 1, 19--21 (1992; Zbl 0773.90080) Full Text: DOI OpenURL
Agarwal, Pankaj K.; Matoušek, Jiří; Suri, Subhash Farthest neighbors, maximum spanning trees and related problems in higher dimensions. (English) Zbl 0769.68037 Comput. Geom. 1, No. 4, 189-201 (1992). MSC: 68Q25 52B05 PDF BibTeX XML Cite \textit{P. K. Agarwal} et al., Comput. Geom. 1, No. 4, 189--201 (1992; Zbl 0769.68037) Full Text: DOI OpenURL
Monma, Clyde; Paterson, Michael; Suri, Subhash; Yao, Frances Computing Euclidean maximum spanning trees. (English) Zbl 0696.68066 Algorithmica 5, No. 3, 407-419 (1990). MSC: 68Q25 68R10 05C05 PDF BibTeX XML Cite \textit{C. Monma} et al., Algorithmica 5, No. 3, 407--419 (1990; Zbl 0696.68066) Full Text: DOI OpenURL