829 search results - page 12 / 166 » Distance domination-critical graphs |
146
click to vote
WEBI
2001
Springer
15 years 10 months ago
2001
Springer
The pages and hyperlinks of the World Wide Web may be viewed as nodes and edges in a directed graph. In this paper, we propose a new definition of the distance between two pages, ...
181
click to vote
CVPR
2003
IEEE
16 years 8 months ago
2003
IEEE
Graph matching is an important component in many object recognition algorithms. Although most graph matching algorithms seek a one-to-one correspondence between nodes, it is often...
156
click to vote
SIAMCOMP
2010
15 years 4 months ago
2010
Let G = (V, E) be a weighted undirected graph having non-negative edge weights. An estimate ˆδ(u, v) of the actual distance δ(u, v) between u, v ∈ V is said to be of stretch t...
163
click to vote
WAW
2007
Springer
16 years 1 days ago
2007
Springer
The geographical threshold graph model is a random graph model with nodes distributed in a Euclidean space and edges assigned through a function of distance and node weights. We st...
155
click to vote
GBRPR
2009
Springer
16 years 15 days ago
2009
Springer
We present an algorithm for graph matching in a pattern recognition context. This algorithm deals with weighted graphs, based on new structural and topological node signatures. Usi...