1154 search results - page 71 / 231 » On the editing distance of graphs |
EWSN
2006
Springer
14 years 9 months ago
2006
Springer
Abstract. We propose a lightweight localisation approach for supporting distance and range queries in ad hoc wireless sensor networks. In contrast to most previous localisation app...
APPROX
2009
Springer
14 years 4 months ago
2009
Springer
We consider adding k shortcut edges (i.e. edges of small fixed length δ ≥ 0) to a graph so as to minimize the weighted average shortest path distance over all pairs of vertices...
CIC
2004
13 years 11 months ago
2004
Hexagonal mesh and torus, as well as honeycomb and certain other pruned torus networks, are known to belong to the class of Cayley graphs which are node-symmetric and possess othe...
CORR
2002
Springer
13 years 9 months ago
2002
Springer
Different types of two- and three-dimensional representations of a finite metric space are studied that focus on the accurate representation of the linear order among the distance...
PODC
2006
ACM
14 years 3 months ago
2006
ACM
We study a novel separator property called k-path separable. Roughly speaking, a k-path separable graph can be recursively separated into smaller components by sequentially removi...