67 search results - page 4 / 14 » On partitioning of hypergraphs |
JPDC
2008
13 years 8 months ago
2008
In this paper, we present parallel multilevel algorithms for the hypergraph partitioning problem. In particular, we describe schemes for parallel coarsening, parallel greedy k-way...
COMBINATORICS
2000
13 years 8 months ago
2000
A (multi)hypergraph H with vertices in N contains a permutation p = a1a2 . . . ak of 1, 2, . . . , k if one can reduce H by omitting vertices from the edges so that the resulting ...
ASPDAC
2006
ACM
14 years 2 months ago
2006
ACM
We propose a methodology for optimal k-way partitioning with replication of directed hypergraphs via Boolean satisfiability. We begin by leveraging the power of existing and emerg...
ICTAI
2007
IEEE
14 years 2 months ago
2007
IEEE
In this paper, we present a new hypergraph partitioning algorithm that jointly optimizes the number of hyperedge cuts and the number of shared vertices in nonlinear constrained op...
ICCAD
1996
IEEE
14 years 22 days ago
1996
IEEE
This paper presents a new spectral partitioning formulation which directly incorporates vertex size information. The new formulation results in a generalized eigenvalue problem, a...