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,...

Full description

Saved in:

Bibliographic Details
Published in:	Theoretical computer science Vol. 575; pp. 33 - 41
Main Authors:	Bhushan, Alka, Sajith, G.
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 13.04.2015
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!