Faster Algorithms for All-Pairs Bounded Min-Cuts - Archive ouverte HAL Access content directly
Conference Papers Year :

Faster Algorithms for All-Pairs Bounded Min-Cuts

(1) , (2) , (3, 4) , (5) , (6) , (5) , (7) , (8)
1
2
3
4
5
6
7
8

Domains

Computer Science [cs]
Fichier principal
Vignette du fichier
LIPIcs-ICALP-2019-7.pdf (628.88 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Marie-France Sagot  : Connect in order to contact the contributor

https://hal.inria.fr/hal-02335025

Submitted on : Monday, October 28, 2019-9:18:59 AM

Last modification on : Friday, November 18, 2022-9:26:25 AM

Long-term archiving on: Wednesday, January 29, 2020-2:32:50 PM

Download

Dates and versions

hal-02335025 , version 1 (28-10-2019)

Identifiers

Cite

Amir Abboud, Loukas Georgiadis, Giuseppe F. 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 Dublin Core DC Terms EndNote Datacite

Collections

INRIA INRIA2
16 View
155 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More