Sciweavers

COCOON
1999
Springer
14 years 4 months ago
On the Complexity of Approximating Colored-Graph Problems
Andrea E. F. Clementi, Pierluigi Crescenzi, Gianlu...
COCOON
1999
Springer
14 years 4 months ago
On Routing in Circulant Graphs
We investigate various problems related to circulant graphs – finding the shortest path between two vertices, finding the shortest loop, and computing the diameter. These probl...
Jin-yi Cai, George Havas, Bernard Mans, Ajay Nerur...
COCOON
1999
Springer
14 years 4 months ago
On Bounds for the k-Partitioning of Graphs
Sergei L. Bezrukov, Robert Elsässer, Ulf-Pete...