67 search results - page 2 / 14 » On partitioning of hypergraphs |
82
Voted
IPCO
2010
14 years 11 months ago
2010
We investigate hypergraphic LP relaxations for the Steiner tree problem, primarily the partition LP relaxation introduced by K
87
Voted
CVPR
2005
IEEE
16 years 8 days ago
2005
IEEE
We consider the problem of clustering in domains where the affinity relations are not dyadic (pairwise), but rather triadic, tetradic or higher. The problem is an instance of the ...
58
Voted
RSA
1998
14 years 10 months ago
1998
: For a pair of integers 1F␥-r, the ␥-chromatic number of an r-uniform Ž .hypergraph Hs V, E is the minimal k, for which there exists a partition of V into subsets < <T ...
DAC
1999
ACM
15 years 11 months ago
1999
ACM
83
Voted
DAC
1989
ACM
15 years 2 months ago
1989
ACM
We present a new 0 (n2) heuristic for hypergraph min-cut bipartitioning, an important problem in circuit placement. Fastest previous methods for this problem are O(n2 log n). Our ...