Skip to Main content Skip to Navigation
Conference papers

Faster Algorithms for All-Pairs Bounded Min-Cuts

Document type :
Conference papers
Complete list of metadatas

Cited literature [36 references]  Display  Hide  Download

https://hal.inria.fr/hal-02335025
Contributor : Marie-France Sagot <>
Submitted on : Monday, October 28, 2019 - 9:18:59 AM
Last modification on : Saturday, November 21, 2020 - 9:54:03 AM
Long-term archiving on: : Wednesday, January 29, 2020 - 2:32:50 PM

File

LIPIcs-ICALP-2019-7.pdf
Publisher files allowed on an open archive

Identifiers

Collections

Citation

Amir Abboud, Loukas Georgiadis, Giuseppe Italiano, Robert Krauthgamer, Nikos Parotsidis, et al.. Faster Algorithms for All-Pairs Bounded Min-Cuts. ICALP 2019 - 46th International Colloquium on Automata, Languages and Programming, Jul 2019, Patras, Greece. pp.1-15, ⟨10.4230/LIPIcs.ICALP.2019.7⟩. ⟨hal-02335025⟩

Share

Metrics

Record views

37

Files downloads

254