Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

IPPS
2000
IEEE

favoriteEmaildiscussreport

147views Distributed And Parallel Com...» more IPPS 2000»

A Multilevel Algorithm for Spectral Partitioning with Extended Eigen-Models

13 years 8 months ago

A Multilevel Algorithm for Spectral Partitioning with Extended Eigen-Models

Download ipdps.cc.gatech.edu

Parallel solution of irregular problems require solving the graph partitioning problem. The extended eigenproblem appears as the solution of some relaxed formulations of the graph partitioning problem. In this paper, a new subspace algorithm for the solving the extended eigenproblem is presented. The structure of this subspace method allows the incorporation of multigrid preconditioners. We numerically compare our new algorithm with a previous algorithm based on Lanczos iteration and show that our subspace algorithm performs better.

Suely Oliveira, Takako Soma

Real-time Traffic

Distributed And Parallel Computing | Extended Eigenproblem | Graph Partitioning Problem | IPPS 2000 | Subspace Algorithm |

claim paper

Related Content

» Multilevel spectral hypergraph partitioning with arbitrary vertex sizes

» Multilevel Graph Partitioning Schemes

» Multilevel kway Partitioning Scheme for Irregular Graphs

» Weighted Graph Cuts without Eigenvectors A Multilevel Approach

» A fast kernelbased multilevel algorithm for graph clustering

» Boosting Spectral Partitioning by Sampling and Iteration

» Quasirandomness and Algorithmic Regularity for Graphs with General Degree Distributions

» A Recommender System Based on Local Random Walks and Spectral Methods

» Normalized tree partitioning for image segmentation

Post Info
More Details (n/a)

Added	31 Jul 2010
Updated	31 Jul 2010
Type	Conference
Year	2000
Where	IPPS
Authors	Suely Oliveira, Takako Soma

Comments (0)