723 search results - page 43 / 145 » On the hyperbolicity constant in graphs |
162
click to vote
COMBINATORICA
2007
15 years 6 months ago
2007
We derive a sufficient condition for a sparse graph G on n vertices to contain a copy of a tree T of maximum degree at most d on (1 − )n vertices, in terms of the expansion prop...
230
click to vote
VLDB
2002
ACM
15 years 5 months ago
2002
ACM
Web-based data sources, particularly in Life Sciences, grow in diversity and volume. Most of the data collections are equipped with common document search, hyperlink and retrieval...
192
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. CAT(0) metric spaces constitute a far-reaching common generalization of Euclidean and hyperbolic spaces and simple polygons: any two points x and y of a CAT(0) metric spa...
146
click to vote
ICALP
2003
Springer
15 years 11 months ago
2003
Springer
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
180
click to vote
JAL
2006
15 years 6 months ago
2006
Distance labeling schemes are schemes that label the vertices of a graph with short labels in such a way that the distance between any two vertices u and v can be determined effic...