Faster Algorithms for All-Pairs Bounded Min-Cuts

Amir Abboud 1 Loukas Georgiadis 2 Giuseppe Italiano 3, 4 Robert Krauthgamer 5 Nikos Parotsidis 6 Ohad Trabelsi 5 Przemysław Uznański 7 Daniel Wolleb-Graf 8
1 IBM Almaden Research Center
2 CS - Department of Computer Science - University of Ioannina (University of Ioannina)
3 LUISS - Libera Università Internazionale degli Studi Sociali Guido Carli [Roma]
4 ERABLE - Equipe de recherche européenne en algorithmique et biologie formelle et expérimentale
Inria Grenoble - Rhône-Alpes
5 Weizmann Institute of Science
6 KU - University of Copenhagen = Københavns Universitet
7 University of Wrocław [Poland]
8 ETH Zürich - Eidgenössische Technische Hochschule - Swiss Federal Institute of Technology in Zürich [Zürich]
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 : Tuesday, November 26, 2019 - 8:52:44 AM

File

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

Identifiers

Collections

INRIA

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⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

14

Files downloads

157

 

 

Contact

archive-ouverte@inria.fr