148 search results - page 9 / 30 » Analysis of Multilevel Graph Partitioning |
FSTTCS
2004
Springer
14 years 27 days ago
2004
Springer
Abstract Abstract. In this paper we improve the analysis of approximation algorithms based on semidefinite programming for the maximum graph partitioning problems MAX-k-CUT, MAX-k...
DMIN
2006
13 years 9 months ago
2006
- Clustering of data is an important data mining application. One of the problems with traditional partitioning clustering methods is that they partition the data into hard bound n...
STOC
2004
ACM
14 years 7 months ago
2004
ACM
We give a O( log n)-approximation algorithm for sparsest cut, edge expansion, balanced separator, and graph conductance problems. This improves the O(log n)-approximation of Leig...
ICCD
2002
IEEE
14 years 4 months ago
2002
IEEE
Boolean functions are fundamental to synthesis and verification of digital logic, and compact representations of Boolean functions have great practical significance. Popular repre...
IHI
2012
12 years 3 months ago
2012
Despite recent progress in high-throughput experimental studies, systems level visualization and analysis of large protein interaction networks (ppi) remains a challenging task, g...