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-02349024
Contributor : Mourad Baiou <>
Submitted on : Tuesday, November 5, 2019 - 3:07:50 PM
Last modification on : Wednesday, November 6, 2019 - 1:34:40 AM

Identifiers

Citation

Mourad Baïou, Francisco Barahona. Sparsest Cut in Planar Graphs, Maximum Concurrent Flows and Their Connections with the Max-Cut Problem. International Conference on Integer Programming and Combinatorial Optimization (IPCO 2016), pp.63-76, 2016, ⟨10.1007/978-3-319-33461-5_6⟩. ⟨hal-02349024⟩

Share

Metrics

Record views

11