Sciweavers

357 search results - page 6 / 72
» Fast Hypergraph Partition
Sort
View
ICALP
2010
Springer
15 years 4 months ago
On the Inapproximability of Vertex Cover on k-Partite k-Uniform Hypergraphs
Computing a minimum vertex cover in graphs and hypergraphs is a well-studied optimizaton problem. While intractable in general, it is well known that on bipartite graphs, vertex c...
Venkatesan Guruswami, Rishi Saket
101
Voted
CPC
2007
113views more  CPC 2007»
14 years 11 months ago
Regular Partitions of Hypergraphs: Regularity Lemmas
Abstract. Szemer´edi’s regularity lemma for graphs has proved to be a powerful tool with many subsequent applications. The objective of this paper is to extend the techniques de...
Vojtech Rödl, Mathias Schacht
FOCS
2007
IEEE
15 years 6 months ago
Approximate Hypergraph Partitioning and Applications
Eldar Fischer, Arie Matsliah, Asaf Shapira
ITC
2000
IEEE
55views Hardware» more  ITC 2000»
15 years 4 months ago
Low power BIST design by hypergraph partitioning: methodology and architectures
Patrick Girard, Christian Landrault, Loïs Gui...
JPDC
2008
87views more  JPDC 2008»
14 years 11 months ago
Multi-level direct K-way hypergraph partitioning with multiple constraints and fixed vertices
Cevdet Aykanat, Berkant Barla Cambazoglu, Bora U&c...