1154 search results - page 174 / 231 » On the editing distance of graphs |
ALGOSENSORS
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. We present a distributed multi-scale dead-reckoning (MSDR-D) algorithm for network localization that utilizes local distance and angular information for nearby sensors. T...
NETWORKS
2010
13 years 7 months ago
2010
Abstract. In this paper, motivated by applications of ordinary (distance) spanners in communication networks and to address such issues as bandwidth constraints on network links, l...
CP
2011
Springer
12 years 8 months ago
2011
Springer
The distance between two graphs is usually defined by means of the size of a largest common subgraph. This common subgraph may be an induced subgraph, obtained by removing nodes, ...
ISAAC
2004
Springer
14 years 2 months ago
2004
Springer
For c ∈ R, a c-spanner is a subgraph of a complete Euclidean graph satisfying that between any two vertices there exists a path of weighted length at most c times their geometric...
ICDM
2006
IEEE
14 years 2 months ago
2006
IEEE
Due to their capability for expressing semantics and relationships among data objects, semi-structured documents have become a common way of representing domain knowledge. Compari...