754 search results - page 109 / 151 » Exact Algorithms for the Vertex Separator Problem in Graphs |
141
Voted
CVPR
2005
IEEE
16 years 5 months ago
2005
IEEE
In the last decades, a large family of algorithms supervised or unsupervised; stemming from statistic or geometry theory have been proposed to provide different solutions to the p...
113
Voted
STOC
2004
ACM
16 years 4 months ago
2004
ACM
We give a O( log n)-approximation algorithm for sparsest cut, edge expansion, balanced separator, and graph conductance problems. This improves the O(log n)-approximation of Leig...
94
Voted
PLDI
1994
ACM
15 years 7 months ago
1994
ACM
Programslices have potentialuses in manysoftware engineering applications. Traditional slicing algorithms, however, do not work correctly on programs that contain explicit jump st...
149
Voted
IPPS
2010
IEEE
15 years 1 months ago
2010
IEEE
Abstract--For the management of a virtual P2P supercomputer one is interested in subgroups of processors that can communicate with each other efficiently. The task of finding these...
126
Voted
ICRA
2010
IEEE
15 years 2 months ago
2010
IEEE
Abstract— This paper describes a new algorithm for cooperative and persistent simultaneous localization and mapping (SLAM) using multiple robots. Recent pose graph representation...