68 search results - page 8 / 14 » Diameter and connectivity of 3-arc graphs |
PODC
2004
ACM
14 years 29 days ago
2004
ACM
We analyze the properties of Small-World networks, where links are much more likely to connect “neighbor nodes” than distant nodes. In particular, our analysis provides new re...
ISPA
2007
Springer
14 years 1 months ago
2007
Springer
The number of processors embedded in high performance computing platforms is growing daily to solve larger and more complex problems. The logical network topologies must also suppo...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
Abstract—In this paper we ask which properties of a distributed network can be computed from a few amount of local information provided by its nodes. The distributed model we con...
WEA
2007
Springer
14 years 1 months ago
2007
Springer
Dynamic tree data structures maintain forests that change over time through edge insertions and deletions. Besides maintaining connectivity information in logarithmic time, they ca...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Map vertices of a graph to (not necessarily distinct) points of the plane so that two adjacent vertices are mapped at least a unit distance apart. The plane-width of a graph is th...