Deterministic global minimum cut of a simple graph in near-linear time

Ken-ichi Kawarabayashi, Mikkel Thorup

Publikation: Bidrag til bog/antologi/rapportKonferencebidrag i proceedingsForskningpeer review

40 Citationer (Scopus)
OriginalsprogEngelsk
TitelProceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing : STOC '15
Antal sider10
ForlagAssociation for Computing Machinery
Publikationsdato2015
Sider665-674
ISBN (Trykt)978-1-4503-3536-2
DOI
StatusUdgivet - 2015
BegivenhedAnnual ACM Symposium on the Theory of Computing 2015 - Portland, USA
Varighed: 15 jun. 201517 jun. 2015
Konferencens nummer: 47

Konference

KonferenceAnnual ACM Symposium on the Theory of Computing 2015
Nummer47
Land/OmrådeUSA
ByPortland
Periode15/06/201517/06/2015

Emneord

  • deterministic near-linear time, edge connectivity, minimum cut, simple graphs

Citationsformater