208 search results - page 6 / 42 » The diameter of protean graphs |
WDAG
2007
Springer
14 years 1 months ago
2007
Springer
Communication in networks suffers if a link fails. When the links are edges of a tree that has been chosen from an underlying graph of all possible links, a broken link even disco...
DIALM
2003
ACM
14 years 19 days ago
2003
ACM
This paper addresses the problem of scatternet formation for singlehop Bluetooth based ad hoc networks, with minimal communication overhead. We adopt the well-known structure de B...
IJCM
2002
13 years 7 months ago
2002
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to...
COMGEO
1999
ACM
13 years 7 months ago
1999
ACM
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a directed graph having the points of S as its vertices, such that for any pair p and q o...
IAJIT
2011
12 years 10 months ago
2011
: Both the pancake graph and star graph are Cayley graphs and are especially attractive for parallel processing. They both have sublogarithmic diameter, and are fairly sparse compa...