425 search results - page 1 / 85 » Path Coloring on the Mesh |
FOCS
1996
IEEE
13 years 9 months ago
1996
IEEE
In the minimum path coloring problem, we are given a list of pairs of vertices of a graph. We are asked to connect each pair by a colored path. Paths of the same color must be edg...
AUTONOMICS
2008
ACM
13 years 6 months ago
2008
ACM
Inspired by the collective foraging behavior of specific ant species, ant-based routing algorithms are able to find optimal or near optimal packet routes for Wireless Mesh Network...
TOG
2002
13 years 4 months ago
2002
Surface geometry is often modeled with irregular triangle meshes. The process of remeshing refers to approximating such geometry using a mesh with (semi)-regular connectivity, whi...
CIAC
2010
Springer
13 years 8 months ago
2010
Springer
We investigate the relationship between two kinds of vertex colorings of graphs: uniquemaximum colorings and conflict-free colorings. In a unique-maximum coloring, the colors are ...
MM
2004
ACM
13 years 10 months ago
2004
ACM
An optimized scheme of multiplexing coded mesh and texture data to facilitate progressive transmission of 3D textured models is proposed in this work. The mesh and texture data of...