COCOON
1999
Springer
15 years 16 days ago
1999
Springer
We present results related to satisfying shortest path queries on a planar graph stored in external memory. Let N denote the number of vertices in the graph and let sort(N) denote...
COCOON
1999
Springer
15 years 16 days ago
1999
Springer
COCOON
1999
Springer
15 years 16 days ago
1999
Springer
Scheduling jobs with pairwise conflicts is modeled by the graph multicoloring problem. It occurs in two versions: in the preemptive case, each vertex may get any set of colors, w...
COCOON
1999
Springer
15 years 16 days ago
1999
Springer
Cai and Selman [CS99] defined a modification of Levin’s notion of average polynomial time and proved, for every P-bi-immune language L and every polynomial-time computable dis...
COCOON
1999
Springer
15 years 16 days ago
1999
Springer
COCOON
1999
Springer
15 years 16 days ago
1999
Springer
COCOON
1999
Springer
15 years 16 days ago
1999
Springer
COCOON
1999
Springer
15 years 16 days ago
1999
Springer
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...
COCOON
1999
Springer
15 years 16 days ago
1999
Springer
COCOON
2010
Springer
15 years 17 days ago
2010
Springer