1154 search results - page 40 / 231 » On the editing distance of graphs |
ISAAC
2005
Springer
14 years 2 months ago
2005
Springer
A graph G is δ-hyperbolic if for any four vertices u, v, x, y of G the two larger of the three distance sums dG(u, v) + dG(x, y), dG(u, x) + dG(v, y), dG(u, y) + dG(v, x) differ b...
ECUMN
2007
Springer
14 years 2 months ago
2007
Springer
This article presents a novel method for computing distances between hosts in a computational Grid. Our method allows to represent the cost to achieve any operation involving some...
WEA
2009
Springer
14 years 3 months ago
2009
Springer
What does it mean for two geometric graphs to be similar? We propose a distance for geometric graphs that we show to be a metric, and that can be computed by solving an integer li...
HT
2000
ACM
14 years 1 months ago
2000
ACM
Software components for distance and just-in-time (JIT) learning are an increasingly common method of encouraging reuse and facilitating the development process[58], but no analog...
NETWORK
2010
13 years 3 months ago
2010
In this article we report on applications and extensions of weighted graph theory in the design and control of communication networks. We model the communication network as a weig...