1154 search results - page 47 / 231 » On the editing distance of graphs |
ISAAC
2004
Springer
14 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
13 years 6 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...
CAE
2007
13 years 11 months ago
2007
We present a stipple placement method which provides extra emphasis to image features, especially edges. Our algorithm transforms an image into a regular graph, with edge weights ...
COMPGEOM
2011
ACM
13 years 9 days 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
GD
2005
Springer
14 years 2 months ago
2005
Springer