534 search results - page 1 / 107 » Diameter critical graphs |
IJCM
2002
13 years 4 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...
CIAC
2000
Springer
13 years 8 months ago
2000
Springer
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 ...
JCT
2010
13 years 2 months ago
2010
In 1978, Chv´atal and Thomassen proved that every 2-edge-connected graph with diameter 2 has an orientation with diameter at most 6. They also gave general bounds on the smallest...
ARSCOM
2006
13 years 4 months ago
2006
MacGillivray and Seyffarth (J. Graph Theory 22 (1996), 213
SODA
2001
ACM
13 years 5 months ago
2001
ACM
Many massive graphs (such as the WWW graph and Call graphs) share certain universal characteristics which can be described by so-called the "power law". Here we determin...