Sciweavers

206 search results - page 42 / 42
» A distributed approximation algorithm for the minimum degree...
Sort
View
147
Voted
SPAA
2003
ACM
15 years 9 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