723 search results - page 29 / 145 » On the hyperbolicity constant in graphs |
135
click to vote
SSS
2010
Springer
15 years 4 months ago
2010
Springer
We consider the question of how much information can be stored by labeling the vertices of a connected undirected graph G using a constant-size set of labels, when isomorphic label...
161
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
In this paper we consider the problem of reconstructing a hidden weighted
hypergraph of constant rank using additive queries. We prove the following: Let G be
a weighted hidden h...
159
click to vote
FSTTCS
2010
Springer
15 years 4 months ago
2010
Springer
ABSTRACT. The maximum independent set problem (MAXIS) on general graphs is known to be NPhard to approximate within a factor of n1-, for any > 0. However, there are many "...
169
click to vote
ADHOCNOW
2008
Springer
16 years 16 days ago
2008
Springer
We present 1 − approximation algorithms for the maximum matching problem in location aware unit disc graphs and in growth-bounded graphs. The algorithm for unit disk graph is loc...
161
click to vote
STOC
2010
ACM
15 years 11 months ago
2010
ACM
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...