112 search results - page 2 / 23 » Improved algorithms for hypergraph bipartitioning |
WG
1993
Springer
13 years 9 months ago
1993
Springer
Recently in several papers, graphs with maximum neighborhood orderings were characterized and turned out to be algorithmically useful. This paper gives a unified framework for cha...
APPROX
2008
Springer
13 years 7 months ago
2008
Springer
For every fixed 0, we give an algorithm that, given an n-vertex 3-uniform hypergraph containing an independent set of size n, finds an independent set of size n(2 ) . This improv...
COLOGNETWENTE
2010
13 years 4 months ago
2010
Bisimplicial edges in bipartite graphs are closely related to pivots in Gaussian elimination that avoid turning zeroes into non-zeroes. We present a new deterministic algorithm to...
ICALP
2010
Springer
13 years 10 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...
ACMMSP
2004
ACM
13 years 11 months ago
2004
ACM
Irregular applications frequently exhibit poor performance on contemporary computer architectures, in large part because of their inefficient use of the memory hierarchy. Runtime ...