425 search results - page 20 / 85 » Path Coloring on the Mesh |
127
click to vote
EUROPAR
2009
Springer
15 years 8 months ago
2009
Springer
In this work we consider deterministic oblivious dimensional routing algorithms on d-dimensional meshes. In oblivious dimensional routing algorithms the path of a packet depends o...
123
click to vote
CG
2005
Springer
15 years 1 months ago
2005
Springer
We present a new algorithm to compute a geodesic path over a triangulated surface. Based on Sethian's Fast Marching Method and Polthier's Straightest Geodesics theory, w...
109
click to vote
COMBINATORICA
2008
15 years 1 months ago
2008
A parity walk in an edge-coloring of a graph is a walk along which each color is used an even number of times. Let p(G) be the least number of colors in an edge-coloring of G havi...
118
Voted
IMR
2003
Springer
15 years 7 months ago
2003
Springer
The visualization of 3D vector and tensor fields in a 2D image is challenging because the large amount of information will either be mixed during projection to 2D or lead to seve...
88
Voted
EJC
2006
15 years 1 months ago
2006
The problem of counting plane trees with n edges and an even or an odd number of leaves has been recently studied by Eu, Liu and Yeh, in connection with an identity on coloring ne...