A new approach to the minimum cut problem

This paper present a new approach to finding minimum cuts in undirected graphs. The fundamental principle is simple: the edges in a graph's minimum cut form an extremely small fraction of the graph's edges. Using this idea, we give a randomized, strongly polynomial algorithm that finds the...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Journal of the ACM 1996-07, Vol.43 (4), p.601-640
Hauptverfasser:	KARGER, D. R, STEIN, C
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Computer science control theory systems Computers Connectivity Data structures Exact sciences and technology Graphical representations Graphs Information retrieval. Graph Mathematics Parallel processing Polynomials Processors Reliability Studies Theoretical computing Traveling salesman problem
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!