534 search results - page 32 / 107 » Diameter critical graphs |
ISPAN
1997
IEEE
14 years 1 months ago
1997
IEEE
The shuffle-exchange permutation network (SEPn) is a fixed degree Cayley graph which has been proposed as a basis for massively parallel systems. We propose a routing algorithm wi...
TIT
2010
13 years 4 months ago
2010
Small-world networks are networks in which the graphical diameter of the network is as small as the diameter of random graphs but whose nodes are highly clustered when compared wit...
JMLR
2010
13 years 8 months ago
2010
How can we generate realistic networks? In addition, how can we do so with a mathematically tractable model that allows for rigorous analysis of network properties? Real networks ...
SOFSEM
1997
Springer
14 years 1 months ago
1997
Springer
: In this paper we rst present a general lower bound on the stabilization time which holds for a number of graph theoretic problems, including leader election, spanning tree constr...
SIROCCO
2007
13 years 11 months ago
2007
This paper studies the problem of broadcasting in synchronous point-to-point networks, where one initiator owns a piece of information that has to be transmitted to all other verti...