Sciweavers

684 search results - page 32 / 137
» On embedding well-separable graphs
Sort
View
FOCS
2008
IEEE
15 years 4 months ago
Some Results on Greedy Embeddings in Metric Spaces
Geographic Routing is a family of routing algorithms that uses geographic point locations as addresses for the purposes of routing. Such routing algorithms have proven to be both ...
Ankur Moitra, Tom Leighton
CVPR
2012
IEEE
13 years 4 days ago
Robust non-rigid registration of 2D and 3D graphs
We present a new approach to matching graphs embedded in R2 or R3 . Unlike earlier methods, our approach does not rely on the similarity of local appearance features, does not req...
Eduard Serradell, Przemyslaw Glowacki, Jan Kybic, ...
IEICET
2011
14 years 4 months ago
Generation of Symmetric and Asymmetric Biconnected Rooted Outerplanar Graphs
In a rooted graph, a vertex is designated as its root. An outerplanar graph is represented by a plane embedding such that all vertices appear along its outer boundary. Two differ...
Bingbing Zhuang, Hiroshi Nagamochi