446 search results - page 42 / 90 » A fast algorithm for computing steiner edge connectivity |
ICCSA
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We consider geometric shortest path queries between arbitrary pairs of objects on a connected polyhedral surface P of genus g. The query objects are points, vertices, edg...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We provide linear-time algorithms for geometric graphs with sublinearly many crossings. That is, we provide algorithms running in O(n) time on connected geometric graphs having n ...
STOC
2010
ACM
14 years 5 months ago
2010
ACM
We consider the problem of maintaining a large matching or a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge ins...
IPPS
2007
IEEE
14 years 1 months ago
2007
IEEE
In this paper, first order diffusion load balancing algorithms for totally dynamic networks are investigated. Totally dynamic networks are networks in which the topology may chan...
GD
1998
Springer
13 years 11 months ago
1998
Springer
We consider the problem of visualizing interconnections in railway systems. Given time tables from systems with thousands of trains, we are to visualize basic properties of the co...