I/O efficient algorithms for the minimum cut problem on unweighted undirected graphs

The problem of finding the minimum cut of an undirected unweighted graph is studied on the external memory model. First, a lower bound of Ω((E/V)Sort(V)) on the number of I/Os is shown for the problem, where V is the number of vertices and E is the number of edges. Then the following are presented,...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Theoretical computer science Ročník 575; s. 33 - 41
Hlavní autori:	Bhushan, Alka, Sajith, G.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 13.04.2015
Predmet:	Algorithms Computer simulation Constants External memory algorithm Graph algorithm Graph theory Graphs I/O complexity Lower bound Lower bounds Mathematical models Minimum cut Trees I/O complexity Lower bound External memory algorithm Minimum cut Graph algorithm
ISSN:	0304-3975, 1879-2294
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!