9 search results - page 1 / 2 » Optimal vertex ranking of block graphs |
IANDC
2008
13 years 4 months ago
2008
FOCS
2006
IEEE
13 years 11 months ago
2006
IEEE
A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than...
IM
2007
13 years 4 months ago
2007
A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than...
ICPR
2004
IEEE
14 years 6 months ago
2004
IEEE
Corner matching constitutes a fundamental vision problem that serves as a building block of several important applications. The common approach to dealing with this problem starts...
AIPS
2009
13 years 6 months ago
2009
Probabilistic Roadmaps (PRM) are a commonly used class of algorithms for robot navigation tasks where obstacles are present in the environment. We examine the situation where the ...