Sciweavers

2137 search results - page 6 / 428
» Approximation Algorithms for Some Graph Partitioning Problem...
Sort
View
IPPS
2000
IEEE
13 years 12 months ago
A Multilevel Algorithm for Spectral Partitioning with Extended Eigen-Models
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 ...
Suely Oliveira, Takako Soma
LION
2009
Springer
152views Optimization» more  LION 2009»
14 years 2 months ago
Comparison of Coarsening Schemes for Multilevel Graph Partitioning
Graph partitioning is a well-known optimization problem of great interest in theoretical and applied studies. Since the 1990s, many multilevel schemes have been introduced as a pra...
Cédric Chevalier, Ilya Safro
COMBINATORICA
2010
13 years 2 months ago
Approximation algorithms via contraction decomposition
We prove that the edges of every graph of bounded (Euler) genus can be partitioned into any prescribed number k of pieces such that contracting any piece results in a graph of bou...
Erik D. Demaine, MohammadTaghi Hajiaghayi, Bojan M...
HICSS
2008
IEEE
199views Biometrics» more  HICSS 2008»
14 years 1 months ago
Clustering and the Biclique Partition Problem
A technique for clustering data by common attribute values involves grouping rows and columns of a binary matrix to make the minimum number of submatrices all 1’s. As binary mat...
Doina Bein, Linda Morales, Wolfgang W. Bein, C. O....
PPAM
2007
Springer
14 years 1 months ago
Application of Fusion-Fission to the Multi-way Graph Partitioning Problem
This paper presents an application of the Fusion-Fission method to the multi-way graph partitioning problem. The Fusion-Fission method was first designed to solve the normalized c...
Charles-Edmond Bichot