1951 search results - page 141 / 391 » An algorithm for improving graph partitions |
141
Voted
FOCS
2009
IEEE
15 years 11 months ago
2009
IEEE
— We present new combinatorial algorithms for Boolean matrix multiplication (BMM) and preprocessing a graph to answer independent set queries. We give the first asymptotic impro...
139
click to vote
IJRR
2010
15 years 1 months ago
2010
We present an anytime algorithm for coordinating multiple autonomous searchers to find a potentially adversarial target on a graphical representation of a physical environment. Th...
134
click to vote
AAAI
1996
15 years 6 months ago
1996
We present an improvement to Harvey and Ginsberg's limited discrepancy search algorithm, which eliminates much of the redundancy in the original, by generating each path from...
122
Voted
ALENEX
2009
15 years 5 months ago
2009
In this paper we present an experimental study of several maximum flow algorithms in the context of unbalanced bipartite networks. Our experiments are motivated by a real world pr...
119
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Let V be a finite set of points in the plane. We present a 2-local algorithm that constructs a plane 4 3 9 -spanner of the unit-disk graph UDG(V ). This algorithm makes only one ...