Graph Partitioning with Natural Cuts

We present a novel approach to graph partitioning based on the notion of cuts. Our algorithm, called PUNCH, has two phases. The first phase performs a series of minimum-cut computations to identify and contract dense regions of the graph. This reduces the graph size, but preserves its general struct...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Delling, D., Goldberg, A. V., Razenshteyn, I., Werneck, R. F.
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Assembly Contracts Greedy algorithms Image edge detection Partitioning algorithms Radiation detectors Roads
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!