COCOON
13 years 10 months ago
2001 Springer 
d by an application in thinwire visualization, we study an abstract on-line scheduling problem where the size of each requested service can be scaled down by the scheduler. Thus o...
COCOON
13 years 10 months ago
2001 Springer 
A data structure called PC-tree is introduced as a generalization of PQ-trees. PC-trees were originally introduced in a planarity test of Shih and Hsu [7] where they represent par...
COCOON
13 years 10 months ago
2001 Springer 
We present a simple space saving trick that applies to many previous algorithms for transitive closure and shortest paths in dynamic directed graphs. In these problems, an update c...
COCOON
13 years 9 months ago
2001 Springer  COCOON
13 years 10 months ago
2001 Springer  |
Combinatorics