Isoperimetric Partitioning: A New Algorithm for Graph Partitioning

We present a new algorithm for graph partitioning based on optimization of the combinatorial isoperimetric constant. It is shown empirically that this algorithm is competitive with other global partitioning algorithms in terms of partition quality. The isoperimetric algorithm is easy to parallelize,...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	SIAM journal on scientific computing Ročník 27; číslo 6; s. 1844 - 1866
Hlavní autori:	Grady, Leo, Schwartz, Eric L.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Philadelphia, PA Society for Industrial and Applied Mathematics 01.01.2006
Predmet:	Algorithms Applied sciences Exact sciences and technology Functions of a complex variable Graphs Lagrange multiplier Markov processes Mathematical analysis Mathematics Operational research and scientific management Operational research. Management science Portfolio theory Probability and statistics Probability theory and stochastic processes Risk theory. Actuarial science Sciences and techniques of general use 60J75 30A36 Random walk Optimization method Graph theory 91B28 Combinatorial optimization Competitive algorithms Graph partitioning Numerical analysis Linear equation Spectral partitioning isoperimetric problem 91B30 Mathematical programming linear equations
ISSN:	1064-8275, 1095-7197
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!