9 search results - page 1 / 2 » Optimal vertex ranking of block graphs |
85
Voted
IANDC
2008
15 years 19 days ago
2008
142
click to vote
FOCS
2006
IEEE
15 years 6 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...
124
click to vote
IM
2007
15 years 15 days 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...
119
Voted
ICPR
2004
IEEE
16 years 1 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...
121
Voted
AIPS
2009
15 years 1 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 ...