388 search results - page 3 / 78 » An approximate algorithm for median graph computation using ... |
128
Voted
GD
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. We consider the problem of simultaneous embedding of planar graphs. We demonstrate how to simultaneously embed a path and an n-level planar graph and how to use radial em...
142
click to vote
SPAA
2004
ACM
15 years 8 months ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
129
click to vote
COMPGEOM
2006
ACM
15 years 9 months ago
2006
ACM
Embedding metrics into constant-dimensional geometric spaces, such as the Euclidean plane, is relatively poorly understood. Motivated by applications in visualization, ad-hoc netw...
161
click to vote
CVPR
2004
IEEE
16 years 5 months ago
2004
IEEE
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...
137
click to vote
CVPR
2003
IEEE
16 years 5 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...