4865 search results - page 40 / 973 » The Complexity of Graph Connectivity |
PODC
2005
ACM
14 years 3 months ago
2005
ACM
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...
NETWORKING
2008
13 years 11 months ago
2008
The second smallest eigenvalue of the Laplacian matrix, also known as the algebraic connectivity, plays a special role for the robustness of complex networks since it measures the ...
ICCS
2004
Springer
14 years 3 months ago
2004
Springer
Complex Network of Earthquakes Sumiyoshi Abe Institute of Physics, University of Tsukuba Ibaraki 3058571, Japan First, a brief discussion is made about a relevance of nonextensive...
COCOON
2009
Springer
14 years 4 months ago
2009
Springer
It is shown that for every finite set of disjoint convex polygonal obstacles in the plane, with a total of n vertices, the free space around the obstacles can be partitioned into ...
TPCG
2003
IEEE
14 years 3 months ago
2003
IEEE
In many application areas an optimal visualization of a complex graph depends on the specific task to be accomplished by the user. Therefore a means of locally customizable layou...