39 search results - page 5 / 8 » Oriented diameter of graphs with diameter 3 |
SPAA
2010
ACM
14 years 5 days ago
2010
ACM
We study a natural network creation game, in which each node locally tries to minimize its local diameter or its local average distance to other nodes, by swapping one incident ed...
WADS
2007
Springer
14 years 1 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 ...
ISCI
2011
13 years 2 months ago
2011
We define an interconnection network AQn,k which we call the augmented kary n-cube by extending a k-ary n-cube in a manner analogous to the existing extension of an n-dimensional...
ARSCOM
2007
13 years 7 months ago
2007
Let us denote by EX (m, n; {C4, . . . , C2t}) the family of bipartite graphs G with m and n vertices in its classes that contain no cycles of length less than or equal to 2t and h...
JNW
2008
13 years 7 months ago
2008
Abstract-- We study the communication primitive of broadcasting (one-to-all communication) in known topology radio networks, i.e., where for each primitive the schedule of transmis...