534 search results - page 25 / 107 » Diameter critical graphs |
100
click to vote
CORR
2008
Springer
14 years 11 months ago
2008
Springer
Geometric routing algorithms like GFG (GPSR) are lightweight, scalable algorithms that can be used to route in resource-constrained ad hoc wireless networks. However, such algorith...
GD
2003
Springer
15 years 4 months ago
2003
Springer
We introduce an energy model whose minimum energy drawings reveal the clusters of the drawn graph. Here a cluster is a set of nodes with many internal edges and few edges to nodes ...
EJC
2008
14 years 11 months ago
2008
Let be a triangle-free distance-regular graph with diameter d 3, valency k 3 and intersection number a2 = 0. Assume has an eigenvalue with multiplicity k. We show that if for ...
102
Voted
WADS
2007
Springer
15 years 5 months ago
2007
Springer
Let G = (V, E) be an weighted undirected graph on n vertices and m edges, and let dG be its shortest path metric. We present two simple deterministic algorithms for approximating ...
SOFSEM
2007
Springer
15 years 5 months ago
2007
Springer
We study two aspects of a generalization of the Tower of Hanoi puzzle. In 1981, D. Wood suggested its variant, where a bigger disk may be placed higher than a smaller one if their ...