Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem

Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-02349051
Contributor : Mourad Baiou <>
Submitted on : Tuesday, November 5, 2019 - 3:14:48 PM
Last modification on : Wednesday, November 6, 2019 - 1:34:39 AM

Identifiers

Citation

Mourad Baïou, Francisco Barahona. Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem. Mathematical Programming, Springer Verlag, 2018, 172 (1-2), pp.59-75. ⟨10.1007/s10107-017-1227-3⟩. ⟨hal-02349051⟩

Share

Metrics

Record views

13