1951 search results - page 1 / 391 » An algorithm for improving graph partitions |
FSTTCS
2004
Springer
13 years 10 months 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...
SODA
2008
ACM
13 years 6 months ago
2008
ACM
ICDCS
1994
IEEE
13 years 8 months ago
1994
IEEE
SCAM
2003
IEEE
13 years 9 months ago
2003
IEEE
Many static analyses aim at assigning to each control point of a program an invariant property that characterizes any state of a trace corresponding to this point. The choice of t...
ISCAS
1994
IEEE
13 years 8 months ago
1994
IEEE
In layout design nding e ciently good solutions to the hypergraph bipartitioning problem is of great importance. This paper introduces a new algorithm, the dynamic locking algorit...