Sciweavers

41 search results - page 9 / 9
» A Self-Stabilizing Distributed Approximation Algorithm for t...
Sort
View
SPAA
2003
ACM
15 years 7 months ago
Short length menger's theorem and reliable optical routing
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...
Amitabha Bagchi, Amitabh Chaudhary, Petr Kolman