Miao, Dongjing; Li, Jianzhong; Cai, Zhipeng Maximum reachability preserved graph cut. (English) Zbl 07248842 Theor. Comput. Sci. 840, 187-198 (2020). MSC: 68R10 68Q17 68Q25 PDF BibTeX XML Cite \textit{D. Miao} et al., Theor. Comput. Sci. 840, 187--198 (2020; Zbl 07248842) Full Text: DOI
Bérczi, Kristóf; Chandrasekaran, Karthekeyan; Király, Tamás; Madan, Vivek Improving the integrality gap for multiway cut. (English) Zbl 1450.90038 Math. Program. 183, No. 1-2 (B), 171-193 (2020). MSC: 90C27 PDF BibTeX XML Cite \textit{K. Bérczi} et al., Math. Program. 183, No. 1--2 (B), 171--193 (2020; Zbl 1450.90038) Full Text: DOI
Chandrasekaran, Karthekeyan; Mnich, Matthias; Mozaffari, Sahand Odd multiway cut in directed acyclic graphs. (English) Zbl 1443.68123 SIAM J. Discrete Math. 34, No. 2, 1385-1408 (2020). MSC: 68R10 68Q27 68W25 PDF BibTeX XML Cite \textit{K. Chandrasekaran} et al., SIAM J. Discrete Math. 34, No. 2, 1385--1408 (2020; Zbl 1443.68123) Full Text: DOI
Papadopoulos, Charis; Tzimas, Spyridon Subset feedback vertex set on graphs of bounded independent set size. (English) Zbl 1435.68244 Theor. Comput. Sci. 814, 177-188 (2020). MSC: 68R10 05C69 05C85 68Q17 68Q25 68W40 PDF BibTeX XML Cite \textit{C. Papadopoulos} and \textit{S. Tzimas}, Theor. Comput. Sci. 814, 177--188 (2020; Zbl 1435.68244) Full Text: DOI
Zschoche, Philipp; Fluschnik, Till; Molter, Hendrik; Niedermeier, Rolf The complexity of finding small separators in temporal graphs. (English) Zbl 1436.68265 J. Comput. Syst. Sci. 107, 72-92 (2020). MSC: 68R10 68Q17 68Q25 68Q27 PDF BibTeX XML Cite \textit{P. Zschoche} et al., J. Comput. Syst. Sci. 107, 72--92 (2020; Zbl 1436.68265) Full Text: DOI
Bliznets, Ivan; Sagunov, Danil On happy colorings, cuts, and structural parameterizations. (English) Zbl 07173297 Sau, Ignasi (ed.) et al., Graph-theoretic concepts in computer science. 45th international workshop, WG 2019, Vall de Núria, Spain, June 19–21, 2019. Revised papers. Cham: Springer (ISBN 978-3-030-30785-1/pbk; 978-3-030-30786-8/ebook). Lecture Notes in Computer Science 11789, 148-161 (2019). MSC: 68R10 PDF BibTeX XML Cite \textit{I. Bliznets} and \textit{D. Sagunov}, Lect. Notes Comput. Sci. 11789, 148--161 (2019; Zbl 07173297) Full Text: DOI
Buchbinder, Niv; Schwartz, Roy; Weizman, Baruch A simple algorithm for the multiway cut problem. (English) Zbl 07165848 Oper. Res. Lett. 47, No. 6, 587-593 (2019). MSC: 90 PDF BibTeX XML Cite \textit{N. Buchbinder} et al., Oper. Res. Lett. 47, No. 6, 587--593 (2019; Zbl 07165848) Full Text: DOI
Bérczi, Kristóf; Chandrasekaran, Karthekeyan; Király, Tamás; Madan, Vivek Improving the integrality gap for multiway cut. (English) Zbl 1436.90117 Lodi, Andrea (ed.) et al., Integer programming and combinatorial optimization. 20th international conference, IPCO 2019, Ann Arbor, MI, USA, May 22–24, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11480, 115-127 (2019). MSC: 90C27 90C59 PDF BibTeX XML Cite \textit{K. Bérczi} et al., Lect. Notes Comput. Sci. 11480, 115--127 (2019; Zbl 1436.90117) Full Text: DOI
Hirai, Hiroshi A dual descent algorithm for node-capacitated multiflow problems and its applications. (English) Zbl 07044619 ACM Trans. Algorithms 15, No. 1, Article No. 15, 24 p. (2019). MSC: 90B10 68W25 PDF BibTeX XML Cite \textit{H. Hirai}, ACM Trans. Algorithms 15, No. 1, Article No. 15, 24 p. (2019; Zbl 07044619) Full Text: DOI arXiv
Chandrasekaran, Karthekeyan; Mozaffari, Sahand Odd multiway cut in directed acyclic graphs. (English) Zbl 1443.68124 Lokshtanov, Daniel (ed.) et al., 12th international symposium on parameterized and exact computation, IPEC 2017, Vienna, Austria, September 6–8, 2017. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 89, Article 12, 12 p. (2018). MSC: 68R10 68Q27 68W25 PDF BibTeX XML Cite \textit{K. Chandrasekaran} and \textit{S. Mozaffari}, LIPIcs -- Leibniz Int. Proc. Inform. 89, Article 12, 12 p. (2018; Zbl 1443.68124) Full Text: DOI
Buchbinder, Niv; Naor, Joseph; Schwartz, Roy Simplex partitioning via exponential clocks and the multiway-cut problem. (English) Zbl 1397.68220 SIAM J. Comput. 47, No. 4, 1463-1482 (2018). MSC: 68W25 05C70 05C85 68U05 68W20 PDF BibTeX XML Cite \textit{N. Buchbinder} et al., SIAM J. Comput. 47, No. 4, 1463--1482 (2018; Zbl 1397.68220) Full Text: DOI
Chitnis, Rajesh; Fomin, Fedor V.; Lokshtanov, Daniel; Misra, Pranabendu; Ramanujan, M. S.; Saurabh, Saket Faster exact algorithms for some terminal set problems. (English) Zbl 1371.05283 J. Comput. Syst. Sci. 88, 195-207 (2017). MSC: 05C85 68Q25 PDF BibTeX XML Cite \textit{R. Chitnis} et al., J. Comput. Syst. Sci. 88, 195--207 (2017; Zbl 1371.05283) Full Text: DOI
Kim, Eun Jung; Paul, Christophe; Sau, Ignasi; Thilikos, Dimitrios M. Parameterized algorithms for min-max multiway cut and list digraph homomorphism. (English) Zbl 1370.68131 J. Comput. Syst. Sci. 86, 191-206 (2017). MSC: 68Q25 05C85 PDF BibTeX XML Cite \textit{E. J. Kim} et al., J. Comput. Syst. Sci. 86, 191--206 (2017; Zbl 1370.68131) Full Text: DOI
van Bevern, René; Bredereck, Robert; Chopin, Morgan; Hartung, Sepp; Hüffner, Falk; Nichterlein, André; Suchý, Ondřej Fixed-parameter algorithms for DAG partitioning. (English) Zbl 1355.05204 Discrete Appl. Math. 220, 134-160 (2017). MSC: 05C70 05C85 05C82 05C12 PDF BibTeX XML Cite \textit{R. van Bevern} et al., Discrete Appl. Math. 220, 134--160 (2017; Zbl 1355.05204) Full Text: DOI
Kim, Eun Jung; Paul, Christophe; Sau, Ignasi; Thilikos, Dimitrios M. Parameterized algorithms for MIN-MAX multiway cut and List digraph homomorphism. (English) Zbl 1378.68084 Husfeldt, Thore (ed.) et al., 10th international symposium on parameterized and exact computation, IPEC 2015, Patras, Greece, September 16–18, 2015. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-92-7). LIPIcs – Leibniz International Proceedings in Informatics 43, 78-89 (2015). MSC: 68Q25 05C85 68R10 PDF BibTeX XML Cite \textit{E. J. Kim} et al., LIPIcs -- Leibniz Int. Proc. Inform. 43, 78--89 (2015; Zbl 1378.68084) Full Text: DOI arXiv
Kanj, Iyad; Lin, Guohui; Liu, Tian; Tong, Weitian; Xia, Ge; Xu, Jinhui; Yang, Boting; Zhang, Fenghui; Zhang, Peng; Zhu, Binhai Improved parameterized and exact algorithms for cut problems on trees. (English) Zbl 1333.05293 Theor. Comput. Sci. 607, Part 3, 455-470 (2015). MSC: 05C85 05C05 05C70 68Q25 90C35 PDF BibTeX XML Cite \textit{I. Kanj} et al., Theor. Comput. Sci. 607, Part 3, 455--470 (2015; Zbl 1333.05293) Full Text: DOI
Sharma, Ankit; Vondrák, Jan Multiway cut, pairwise realizable distributions, and descending thresholds. (English) Zbl 1315.68288 Proceedings of the 46th annual ACM symposium on theory of computing, STOC ’14, New York, NY, USA, May 31 – June 3, 2014. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-2710-7). 724-733 (2014). MSC: 68W25 05C40 05C85 PDF BibTeX XML Cite \textit{A. Sharma} and \textit{J. Vondrák}, in: Proceedings of the 46th annual ACM symposium on theory of computing, STOC '14, New York, NY, USA, May 31 -- June 3, 2014. New York, NY: Association for Computing Machinery (ACM). 724--733 (2014; Zbl 1315.68288) Full Text: DOI
Liu, Hong; Zhang, Peng On the generalized multiway cut in trees problem. (English) Zbl 1286.90158 J. Comb. Optim. 27, No. 1, 65-77 (2014). MSC: 90C35 90C27 90C59 PDF BibTeX XML Cite \textit{H. Liu} and \textit{P. Zhang}, J. Comb. Optim. 27, No. 1, 65--77 (2014; Zbl 1286.90158) Full Text: DOI
Cygan, Marek; Pilipczuk, Marcin; Pilipczuk, Michał; Wojtaszczyk, Jakub Onufry On multiway cut parameterized above lower bounds. (English) Zbl 1322.68098 ACM Trans. Comput. Theory 5, No. 1, Article No. 3, 11 p. (2013). MSC: 68Q25 05C70 05C85 68Q17 90C05 PDF BibTeX XML Cite \textit{M. Cygan} et al., ACM Trans. Comput. Theory 5, No. 1, Article No. 3, 11 p. (2013; Zbl 1322.68098) Full Text: DOI
Buchbinder, Niv; Naor, Joseph (Seffi); Schwartz, Roy Simplex partitioning via exponential clocks and the multiway cut problem. (English) Zbl 1293.05286 Proceedings of the 45th annual ACM symposium on theory of computing, STOC ’13. Palo Alto, CA, USA, June 1–4, 2013. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-2029-0). 535-544 (2013). MSC: 05C70 68Q17 68W25 PDF BibTeX XML Cite \textit{N. Buchbinder} et al., in: Proceedings of the 45th annual ACM symposium on theory of computing, STOC '13. Palo Alto, CA, USA, June 1--4, 2013. New York, NY: Association for Computing Machinery (ACM). 535--544 (2013; Zbl 1293.05286) Full Text: DOI
Chitnis, Rajesh; Hajiaghayi, MohammadTaghi; Marx, Dániel Fixed-parameter tractability of directed multiway cut parameterized by the size of the cutset. (English) Zbl 1312.68097 SIAM J. Comput. 42, No. 4, 1674-1696 (2013). MSC: 68Q25 05C20 05C40 05C85 PDF BibTeX XML Cite \textit{R. Chitnis} et al., SIAM J. Comput. 42, No. 4, 1674--1696 (2013; Zbl 1312.68097) Full Text: DOI
Anshelevich, Elliot; Caskurlu, Bugra; Hate, Ameya Strategic multiway cut and multicut games. (English) Zbl 1260.90046 Theory Comput. Syst. 52, No. 2, 200-220 (2013). MSC: 90B15 91A80 PDF BibTeX XML Cite \textit{E. Anshelevich} et al., Theory Comput. Syst. 52, No. 2, 200--220 (2013; Zbl 1260.90046) Full Text: DOI
Dean, Brian C.; Griffis, Adam; Parekh, Ojas; Whitley, Adam Approximation algorithms for \(k\)-hurdle problems. (English) Zbl 1213.68436 Algorithmica 59, No. 1, 81-93 (2011). MSC: 68R10 68W25 PDF BibTeX XML Cite \textit{B. C. Dean} et al., Algorithmica 59, No. 1, 81--93 (2011; Zbl 1213.68436) Full Text: DOI
Karloff, Howard; Khot, Subhash; Mehta, Aranyak; Rabani, Yuval On earthmover distance, metric labeling, and 0-extension. (English) Zbl 1200.68121 SIAM J. Comput. 39, No. 2, 371-387 (2009). MSC: 68Q17 68W25 PDF BibTeX XML Cite \textit{H. Karloff} et al., SIAM J. Comput. 39, No. 2, 371--387 (2009; Zbl 1200.68121) Full Text: DOI
Chen, Jianer; Liu, Yang; Lu, Songjian An improved parameterized algorithm for the minimum node multiway cut problem. (English) Zbl 1194.68168 Algorithmica 55, No. 1, 1-13 (2009). MSC: 68R10 68W05 PDF BibTeX XML Cite \textit{J. Chen} et al., Algorithmica 55, No. 1, 1--13 (2009; Zbl 1194.68168) Full Text: DOI
Soukup, Lajos Infinite combinatorics: from finite to infinite. (English) Zbl 1178.05027 Győri, Ervin (ed.) et al., Horizons of combinatorics. Survey papers related to the conference, Balatonalmádi, Hungary, July 17–21, 2006. Bolyai Society Mathematical Studies 17 (ISBN 978-3-540-77199-9/hbk). 189-213 (2008). MSC: 05Cxx 05C40 05C45 05C05 05C20 05C70 PDF BibTeX XML Cite \textit{L. Soukup}, Bolyai Soc. Math. Stud. 17, 189--213 (2008; Zbl 1178.05027)
Avidor, Adi; Langberg, Michael The multi-multiway cut problem. (English) Zbl 1115.68171 Theor. Comput. Sci. 377, No. 1-3, 35-42 (2007). MSC: 68W25 90C05 PDF BibTeX XML Cite \textit{A. Avidor} and \textit{M. Langberg}, Theor. Comput. Sci. 377, No. 1--3, 35--42 (2007; Zbl 1115.68171) Full Text: DOI
Kamidoi, Yoko; Yoshida, Noriyoshi; Nagamochi, Hiroshi A deterministic algorithm for finding all minimum \(k\)-way cuts. (English) Zbl 1124.05083 SIAM J. Comput. 36, No. 5, 1329-1341 (2006). MSC: 05C85 68R10 68W05 PDF BibTeX XML Cite \textit{Y. Kamidoi} et al., SIAM J. Comput. 36, No. 5, 1329--1341 (2006; Zbl 1124.05083) Full Text: DOI
Chekuri, Chandra; Guha, Sudipto; Naor, Joseph The Steiner \(k\)-cut problem. (English) Zbl 1107.68121 SIAM J. Discrete Math. 20, No. 1, 261-271 (2006). MSC: 68W25 68Q25 90C27 90C59 PDF BibTeX XML Cite \textit{C. Chekuri} et al., SIAM J. Discrete Math. 20, No. 1, 261--271 (2006; Zbl 1107.68121) Full Text: DOI
Khachiyan, L.; Boros, E.; Elbassioni, K.; Gurvich, V.; Makino, K. On the complexity of some enumeration problems for matroids. (English) Zbl 1104.05017 SIAM J. Discrete Math. 19, No. 4, 966-984 (2006). MSC: 05B35 05A99 68Q25 PDF BibTeX XML Cite \textit{L. Khachiyan} et al., SIAM J. Discrete Math. 19, No. 4, 966--984 (2006; Zbl 1104.05017) Full Text: DOI
Marx, Dániel Parameterized graph separation problems. (English) Zbl 1086.68104 Theor. Comput. Sci. 351, No. 3, 394-406 (2006). MSC: 68R10 68Q25 05C85 PDF BibTeX XML Cite \textit{D. Marx}, Theor. Comput. Sci. 351, No. 3, 394--406 (2006; Zbl 1086.68104) Full Text: DOI
Zhao, Liang; Nagamochi, Hiroshi; Ibaraki, Toshihide Greedy splitting algorithms for approximating multiway partition problems. (English) Zbl 1177.90403 Math. Program. 102, No. 1 (A), 167-183 (2005). MSC: 90C35 90C57 PDF BibTeX XML Cite \textit{L. Zhao} et al., Math. Program. 102, No. 1 (A), 167--183 (2005; Zbl 1177.90403) Full Text: DOI
Costa, Marie-Christine; Létocart, Lucas; Roupin, Frédéric Minimal multicut and maximal integer multiflow: a survey. (English) Zbl 1132.90306 Eur. J. Oper. Res. 162, No. 1, 55-69 (2005). MSC: 90B10 90C10 90C35 90C60 PDF BibTeX XML Cite \textit{M.-C. Costa} et al., Eur. J. Oper. Res. 162, No. 1, 55--69 (2005; Zbl 1132.90306) Full Text: DOI
Nicosia, Gaia; Pacifici, Andrea Exact algorithms for a discrete metric labeling problem. (English) Zbl 1152.05368 Liberti, Leo (ed.) et al., Workshop on graphs and combinatorial optimization. Papers from the workshop, Como, Italy, May 31, 2004. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 17, 223-227 (2004). MSC: 05C78 90C57 90C39 PDF BibTeX XML Cite \textit{G. Nicosia} and \textit{A. Pacifici}, Electron. Notes Discrete Math. 17, 223--227 (2004; Zbl 1152.05368) Full Text: DOI
Costa, Marie-Christine; Billionnet, Alain Multiway cut and integer flow problems in trees. (English) Zbl 1152.90353 Liberti, Leo (ed.) et al., Workshop on graphs and combinatorial optimization. Papers from the workshop, Como, Italy, May 31, 2004. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 17, 105-109 (2004). MSC: 90B10 05C99 PDF BibTeX XML Cite \textit{M.-C. Costa} and \textit{A. Billionnet}, Electron. Notes Discrete Math. 17, 105--109 (2004; Zbl 1152.90353) Full Text: DOI
Karger, David R.; Klein, Philip; Stein, Cliff; Thorup, Mikkel; Young, Neal E. Rounding algorithms for a geometric embedding of minimum multiway cut. (English) Zbl 1082.90149 Math. Oper. Res. 29, No. 3, 436-461 (2004). MSC: 90C59 05C40 68Q25 68R10 90C35 PDF BibTeX XML Cite \textit{D. R. Karger} et al., Math. Oper. Res. 29, No. 3, 436--461 (2004; Zbl 1082.90149) Full Text: DOI
Marx, Dániel Parameterized graph separation problems. (English) Zbl 1104.68543 Downey, Rod (ed.) et al., Parametrized and exact computation. First international workshop, IWPEC 2004, Bergen, Norway, September 14–17, 2004. Proceedings. Berlin: Springer (ISBN 3-540-23071-8/pbk). Lecture Notes in Computer Science 3162, 71-82 (2004). MSC: 68R10 05C85 68Q25 PDF BibTeX XML Cite \textit{D. Marx}, Lect. Notes Comput. Sci. 3162, 71--82 (2004; Zbl 1104.68543) Full Text: DOI
Karzanov, Alexander V. Hard cases of the multifacility location problem. (English) Zbl 1077.90036 Discrete Appl. Math. 143, No. 1-3, 368-373 (2004). MSC: 90B80 05C12 90C27 PDF BibTeX XML Cite \textit{A. V. Karzanov}, Discrete Appl. Math. 143, No. 1--3, 368--373 (2004; Zbl 1077.90036) Full Text: DOI
Zhao, Liang; Nagamochi, Hiroshi; Ibaraki, Toshihide On generalized greedy splitting algorithms for multiway partition problems. (English) Zbl 1103.68145 Discrete Appl. Math. 143, No. 1-3, 130-143 (2004). MSC: 68W25 05A18 PDF BibTeX XML Cite \textit{L. Zhao} et al., Discrete Appl. Math. 143, No. 1--3, 130--143 (2004; Zbl 1103.68145) Full Text: DOI
Chekuri, Chandra; Guha, Sudipto; Naor, Joseph Approximating Steiner \(k\)-cuts. (English) Zbl 1039.68166 Baeten, Jos C. M. (ed.) et al., Automata, languages and programming. 30th international colloquium, ICALP 2003, Eindhoven, The Netherland, June 30 – July 4, 2003. Proceedings. Berlin: Springer (ISBN 3-540-40493-7/pbk). Lect. Notes Comput. Sci. 2719, 189-199 (2003). MSC: 68W25 90C27 PDF BibTeX XML Cite \textit{C. Chekuri} et al., Lect. Notes Comput. Sci. 2719, 189--199 (2003; Zbl 1039.68166) Full Text: Link
Naor, Joseph; Zosin, Leonid A 2-approximation algorithm for the directed multiway cut problem. (English) Zbl 1052.68103 SIAM J. Comput. 31, No. 2, 477-482 (2001). MSC: 68R10 05C85 68W10 68Q25 90C27 90C35 68W25 PDF BibTeX XML Cite \textit{J. Naor} and \textit{L. Zosin}, SIAM J. Comput. 31, No. 2, 477--482 (2001; Zbl 1052.68103) Full Text: DOI
Porter, Thom; Yang, Bing Graph partitions. II. (English) Zbl 0988.05050 J. Comb. Math. Comb. Comput. 37, 149-158 (2001). Reviewer: László A.Székely (Columbia/South Carolina) MSC: 05C35 05C15 PDF BibTeX XML Cite \textit{T. Porter} and \textit{B. Yang}, J. Comb. Math. Comb. Comput. 37, 149--158 (2001; Zbl 0988.05050)
Călinescu, Gruia; Karloff, Howard; Rabani, Yuval An improved approximation algorithm of MULTIWAY CUT. (English) Zbl 0986.90043 J. Comput. Syst. Sci. 60, No. 3, 564-574 (2000). MSC: 90C27 90C05 68R10 68W25 PDF BibTeX XML Cite \textit{G. Călinescu} et al., J. Comput. Syst. Sci. 60, No. 3, 564--574 (2000; Zbl 0986.90043) Full Text: DOI
Călinescu, Gruia; Karloff, Howard; Rabani, Yuval An improved approximation algorithm for MULTIWAY CUT. (English) Zbl 1028.68220 STOC ’98. Proceedings of the 30th annual ACM symposium on theory of computing, Dallas, TX, USA, May 23-26, 1998. New York, NY: ACM, Association for Computing Machinery, 48-52 (1998). MSC: 68W25 90C27 68R10 PDF BibTeX XML Cite \textit{G. Călinescu} et al., in: Proceedings of the 30th annual ACM symposium on theory of computing, STOC '98. Dallas, TX, USA, May 23--26, 1998. New York, NY: ACM, Association for Computing Machinery. 48--52 (1998; Zbl 1028.68220)
Erdős, Péter L.; Frank, András; Székely, László Minimum multiway cuts in trees. (English) Zbl 0910.90261 Discrete Appl. Math. 87, No. 1-3, 67-75 (1998). MSC: 90C35 05C85 05C05 PDF BibTeX XML Cite \textit{P. L. Erdős} et al., Discrete Appl. Math. 87, No. 1--3, 67--75 (1998; Zbl 0910.90261) Full Text: DOI Link
Klein, Philip; Rao, Satish; Agrawal, Ajit; Ravi, R. An approximate max-flow min-cut relation for undirected multicommodity flow, with applications. (English) Zbl 0837.68045 Combinatorica 15, No. 2, 187-202 (1995). MSC: 68Q25 68R10 90C08 90C27 PDF BibTeX XML Cite \textit{P. Klein} et al., Combinatorica 15, No. 2, 187--202 (1995; Zbl 0837.68045) Full Text: DOI
Erdös, Péter L.; Székely, László A. On weighted multiway cuts in trees. (English) Zbl 0805.05016 Math. Program. 65, No. 1 (A), 93-105 (1994). Reviewer: S.F.Kapoor (Kalamazoo) MSC: 05C05 90C39 90C35 05C70 90C27 PDF BibTeX XML Cite \textit{P. L. Erdös} and \textit{L. A. Székely}, Math. Program. 65, No. 1 (A), 93--105 (1994; Zbl 0805.05016) Full Text: DOI
Erdös, Péter L.; Székely, László A. Evolutionary trees: An integer multicommodity max-flow – min-cut theorem. (English) Zbl 0773.05047 Adv. Appl. Math. 13, No. 4, 375-389 (1992). MSC: 05C15 05C05 PDF BibTeX XML Cite \textit{P. L. Erdös} and \textit{L. A. Székely}, Adv. Appl. Math. 13, No. 4, 375--389 (1992; Zbl 0773.05047) Full Text: DOI