357 search results - page 6 / 72 » Fast Hypergraph Partition |
118
Voted
ICALP
2010
Springer
15 years 6 months ago
2010
Springer
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...
128
click to vote
CPC
2007
15 years 1 months ago
2007
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...
FOCS
2007
IEEE
15 years 8 months ago
2007
IEEE
ITC
2000
IEEE
15 years 6 months ago
2000
IEEE
71
Voted
JPDC
2008
15 years 1 months ago
2008
