208 search results - page 19 / 42 » The diameter of protean graphs |
ALGORITHMICA
2004
14 years 9 months ago
2004
We consider the problem of finding a minimum diameter spanning tree with maximum node degree B in a complete undirected edge-weighted graph. We provide an O( p logB n)-approximatio...
WG
2005
Springer
15 years 2 months ago
2005
Springer
Abstract. In this paper we study the existence of a small set T of spanning trees that collectively “1-span” an interval graph G. In particular, for any pair of vertices u, v w...
90
Voted
SIAMCOMP
2010
14 years 7 months ago
2010
Abstract. We study the Edge Disjoint Paths (EDP) problem in undirected graphs: Given a graph G with n nodes and a set T of pairs of terminals, connect as many terminal pairs as pos...
92
Voted
FOCS
1994
IEEE
15 years 1 months ago
1994
IEEE
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...
JMLR
2010
14 years 8 months ago
2010
How can we generate realistic networks? In addition, how can we do so with a mathematically tractable model that allows for rigorous analysis of network properties? Real networks ...