4865 search results - page 40 / 973 » The Complexity of Graph Connectivity |
111
click to vote
PODC
2005
ACM
15 years 7 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...
112
click to vote
NETWORKING
2008
15 years 3 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 ...
115
click to vote
ICCS
2004
Springer
15 years 7 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...
105
click to vote
COCOON
2009
Springer
15 years 8 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 ...
123
click to vote
TPCG
2003
IEEE
15 years 7 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...