Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem
Crossref DOI link: https://doi.org/10.1007/s10107-017-1227-3
Published Online: 2018-01-27
Published Print: 2018-11
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Baïou, Mourad
Barahona, Francisco http://orcid.org/0000-0002-4829-7515
Text and Data Mining valid from 2018-01-27
Article History
Received: 29 April 2016
Accepted: 29 December 2017
First Online: 27 January 2018