425 search results - page 16 / 85 » Path Coloring on the Mesh |
CAD
2005
Springer
14 years 11 months ago
2005
Springer
In 3-axis NC (Numerical Control) machining, various cutters are used and the offset compensation for these cutters is important for a gouge free tool path generation. This paper i...
SIGCOMM
2009
ACM
15 years 6 months ago
2009
ACM
Realizing the full potential of a multi-radio mesh network involves two main challenges: how to assign channels to radios at each node to minimize interference and how to choose h...
ESA
2004
Springer
15 years 5 months ago
2004
Springer
We show the first o(n2 ) algorithm for coloring vertices of trianglefree planar graphs using three colors. The time complexity of the algorithm is O(n log n). Our approach can be ...
SPAA
2003
ACM
15 years 5 months ago
2003
ACM
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
129
click to vote
FOCS
1995
IEEE
15 years 3 months ago
1995
IEEE
We consider the following maximum disjoint paths problem (mdpp). We are given a large network, and pairs of nodes that wish to communicate over paths through the network — the g...