704 search results - page 11 / 141 » Isometrically Embedded Graphs |
INFOCOM
2012
IEEE
11 years 10 months ago
2012
IEEE
—Greedy embedding is a graph embedding that makes the simple greedy packet forwarding scheme successful for every source-destination pair. It is desirable that graph embeddings a...
CVPR
2003
IEEE
14 years 9 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...
ESA
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. We prove that for every graph H, there exists a polynomial-time algorithm deciding if a planar graph can be contracted to H. We introduce contractions and topological min...
SIGAL
1990
13 years 11 months ago
1990
In this paper we show that every 2-connected embedded planar graph with faces of sizes
GD
2009
Springer
14 years 5 days ago
2009
Springer
The geometric simultaneous embedding problem asks whether two planar graphs on the same set of vertices in the plane can be drawn using straight lines, such that each graph is pla...