ALGORITHMICA
2007
13 years 11 months ago
2007
We present a new algorithm to compute motorcycle graphs. It runs in O(n √ n log n) time when n is the number of motorcycles. We give a new characterization of the straight skele...
ALGORITHMICA
2007
13 years 11 months ago
2007
ALGORITHMICA
2007
13 years 11 months ago
2007
d abstract) Lars Arge1 , Darren Erik Vengroff2 , and Jeffrey Scott Vitter3 1 BRICS† , Department of Computer Science, University of Aarhus, Aarhus, Denmark 2 Department of Comp...
ALGORITHMICA
2007
13 years 11 months ago
2007
In this paper we study the problems of detecting holes and antiholes in general undirected graphs, and we present algorithms for these problems. For an input graph G on n vertices ...
ALGORITHMICA
2007
13 years 11 months ago
2007
ALGORITHMICA
2007
13 years 11 months ago
2007
A tree t-spanner T in a graph G is a spanning tree of G such that the distance between every pair of vertices in T is at most t times their distance in G. The tree t-spanner proble...