1538 search results - page 109 / 308 » Spectral Techniques in Graph Algorithms |
189
click to vote
WAW
2007
Springer
16 years 13 days ago
2007
Springer
Betweenness is a centrality measure based on shortest paths, widely used in complex network analysis. It is computationally-expensive to exactly determine betweenness; currently th...
234
click to vote
APPROX
2006
Springer
15 years 10 months ago
2006
Springer
For a given graph with weighted vertices, the goal of the minimum-weight dominating set problem is to compute a vertex subset of smallest weight such that each vertex of the graph...
170
click to vote
GD
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. In this paper we present an algorithm for drawing an undirected graph G which takes advantage of the structure of the modular decomposition tree of G. Specifically, our ...
186
click to vote
ALGORITHMICA
1998
15 years 6 months ago
1998
In this paper we give a fully dynamic approximation scheme for maintaining all-pairs shortest paths in planar networks. Given an error parameter ε such that 0 < ε, our algorit...
179
click to vote
GD
2005
Springer
15 years 12 months ago
2005
Springer
This paper describes the GEOMI system, a visual analysis tool for the visualisation and analysis of large and complex networks. GEOMI provides a collection of network analysis meth...