1172 search results - page 84 / 235 » Path Algorithms on Regular Graphs |
COMPGEOM
2010
ACM
15 years 5 months ago
2010
ACM
Let G be an unweighted graph of complexity n cellularly embedded in a surface (orientable or not) of genus g. We describe improved algorithms to compute (the length of) a shortest...
CORR
2008
Springer
15 years 17 days ago
2008
Springer
We provide linear-time algorithms for geometric graphs with sublinearly many crossings. That is, we provide algorithms running in O(n) time on connected geometric graphs having n ...
92
Voted
ICNP
2005
IEEE
15 years 6 months ago
2005
IEEE
Position-based routing protocols in ad hoc networks combine a forwarding strategy with a recovery algorithm. The former fails when there are void regions or physical obstacles tha...
100
Voted
PDPTA
2007
15 years 1 months ago
2007
- The MASC (for Multiple Associative Computing) model is a SIMD model enhanced with associative properties and multiple synchronous instruction streams (IS). A number of algorithms...
94
Voted
DAGM
2004
Springer
15 years 4 months ago
2004
Springer
Abstract. The Gaussian scale-space is a standard tool in image analysis. While continuous in theory, it is generally realized with fixed regular grids in practice. This prevents th...