328 search results - page 9 / 66 » Algorithms for the edge-width of an embedded graph |
GD
2009
Springer
14 years 1 months 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...
ECCV
2004
Springer
14 years 10 months ago
2004
Springer
In recent work, we presented a framework for many-to-many matching of multi-scale feature hierarchies, in which features and their relations were captured in a vertex-labeled, edge...
SWAT
2004
Springer
14 years 2 months ago
2004
Springer
SWAT
2000
Springer
14 years 6 days ago
2000
Springer
GD
2006
Springer
14 years 9 days ago
2006
Springer
Graph drawing research traditionally focuses on producing geometric embeddings of graphs satisfying various aesthetic constraints. However additional work must still be done to dra...