534 search results - page 15 / 107 » Diameter critical graphs |
RSA
2011
13 years 4 months ago
2011
Determining the cardinality and describing the structure of H-free graphs is wellinvestigated for many graphs H. In the nineties, Prömel and Steger proved that for a graph H with...
ICPP
1999
IEEE
14 years 1 months ago
1999
IEEE
In this paper, we present the index-permutation (IP) graph model, and apply it to the systematic development of efficient hierarchical networks. We derive several classes of inter...
NIPS
2008
13 years 11 months ago
2008
Given an n-vertex weighted tree with structural diameter S and a subset of m vertices, we present a technique to compute a corresponding m
CORR
2010
Springer
13 years 9 months ago
2010
Springer
We show that for every connected graph G of diameter 3, the graph G3 has average degree 7 4 (G). We also provide an example showing that this bound is best possible. This resolv...
PODC
2004
ACM
14 years 3 months ago
2004
ACM
We consider the problem of designing a compact communication network that supports efficient routing in an Euclidean plane. Our network design and routing scheme achieves 1+ stret...