829 search results - page 8 / 166 » Distance domination-critical graphs |
147
click to vote
GIS
2006
ACM
15 years 10 months ago
2006
ACM
We give two efficient on-line algorithms to simplify weighted graphs by eliminating degree-two vertices. Our algorithms are on-line -- they react to updates on the data, keeping t...
ISAAC
2004
Springer
15 years 2 months ago
2004
Springer
Let G be a graph containing N disjoint t-spanners that are inter-connected with M edges. We present an algorithm that constructs a data structure of size O(M2 + n log n) that answ...
FOCS
2010
IEEE
14 years 7 months ago
2010
IEEE
We give the first improvement to the space/approximation trade-off of distance oracles since the seminal result of Thorup and Zwick [STOC'01]. For unweighted graphs, our dista...
COMPGEOM
2011
ACM
14 years 1 months ago
2011
ACM
A graph G is a k-sphere graph if there are k-dimensional real vectors v1, . . . , vn such that ij ∈ E(G) if and only if the distance between vi
MLG
2007
Springer
15 years 3 months ago
2007
Springer
d Abstract) Kaspar Riesen, Stefan Fankhauser and Horst Bunke2