643 search results - page 5 / 129 » Supereulerian planar graphs |
SIAMDM
2010
13 years 2 months ago
2010
We consider the problem of finding obnoxious centers in graphs. For arbitrary graphs with n vertices and m edges, we give a randomized algorithm with O(n log2 n + m log n) expecte...
ESA
2007
Springer
14 years 1 months ago
2007
Springer
We present an experimental evaluation of an approximate distance oracle recently suggested by Thorup [1] for undirected planar graphs. The oracle uses the existence of graph separa...
SIAMCOMP
1998
13 years 7 months ago
1998
We consider the problem of maintaining a dynamic planar graph subject to edge insertions and edge deletions that preserve planarity but that can change the embedding. We describe a...
STOC
2007
ACM
14 years 7 months ago
2007
ACM
FOCS
2005
IEEE
14 years 1 months ago
2005
IEEE
In joint work with ´Eva Tardos in 1995, we asked whether it was possible to obtain a polynomial-time, polylogarithmic approximation algorithm for the disjoint paths problem in th...