33 search results - page 7 / 7 » All-Pairs Bottleneck Paths in Vertex Weighted Graphs |
BIRTHDAY
2011
Springer
12 years 4 months ago
2011
Springer
Abstract. Risk analysis has been used to manage the security of systems for several decades. However, its use has been limited to offline risk computation and manual response. In c...
GD
2005
Springer
13 years 10 months ago
2005
Springer
In this paper we investigate the problem of drawing metro maps which is defined as follows. Given a planar graph G of maximum degree 8 with its embedding and vertex locations (e.g...
LATIN
2010
Springer
13 years 11 months ago
2010
Springer
Many divide-and-conquer algorithms employ the fact that the vertex set of a graph of bounded treewidth can be separated in two roughly balanced subsets by removing a small subset o...