449 search results - page 20 / 90 » Measuring the Similarity of Geometric Graphs |
COMPGEOM
2003
ACM
14 years 24 days ago
2003
ACM
Given a polygonal curve and a geometric graph, we describe an efficient algorithm to find a path in the graph which is most similar to the curve, using the well-known Fr´echet d...
EDBT
2011
ACM
12 years 11 months ago
2011
ACM
Graph clustering has generally concerned itself with clustering undirected graphs; however the graphs from a number of important domains are essentially directed, e.g. networks of...
KIVS
2005
Springer
14 years 1 months ago
2005
Springer
: The usage of SuperPeers has been proposed to improve the performance of both Structured and Unstructured Peer-to-Peer (P2P) networks. In this paper we explore a network-aware cla...
PPL
2000
13 years 7 months ago
2000
In this paper we analyze the computational power of random geometric networks in the presence of random (edge or node) faults considering several important network parameters. We ...
GBRPR
2007
Springer
14 years 1 months ago
2007
Springer
In the field of structural pattern recognition graphs constitute a very common and powerful way of representing patterns. In contrast to string representations, graphs allow us to ...