245 search results - page 18 / 49 » Group connectivity of graphs with diameter at most 2 |
WG
1995
Springer
13 years 11 months ago
1995
Springer
Abstract. In this paper, we investigate which processor networks allow klabel Interval Routing Schemes, under the assumption that costs of edges may vary. We show that for each xed...
COMPGEOM
2006
ACM
14 years 1 months ago
2006
ACM
This paper addresses the problem of representing the connectivity information of geometric objects using as little memory as possible. As opposed to raw compression issues, the fo...
TCS
2008
13 years 7 months ago
2008
This paper addresses the problem of representing the connectivity information of geometric objects using as little memory as possible. As opposed to raw compression issues, the fo...
APPROX
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. Given a directed graph G = (V, E) and an integer k 1, a ktransitive-closure-spanner (k-TC-spanner) of G is a directed graph H = (V, EH ) that has (1) the same transitive...
PROPERTYTESTING
2010
13 years 5 months ago
2010
We survey results on transitive-closure spanners and their applications. Given a directed graph G = (V, E) and an integer k 1, a k-transitive-closure-spanner (k-TC-spanner) of G ...