704 search results - page 16 / 141 » Isometrically Embedded Graphs |
COMGEO
2011
ACM
13 years 2 months ago
2011
ACM
A set of planar graphs share a simultaneous embedding if they can be drawn on the same vertex set V in the Euclidean plane without crossings between edges of the same graph. Fixed ...
COMGEO
2007
ACM
13 years 7 months ago
2007
ACM
We consider the problem of simultaneous embedding of planar graphs. There are two variants of this problem, one in which the mapping between the vertices of the two graphs is given...
GBRPR
2009
Springer
14 years 6 days ago
2009
Springer
The median graph has been shown to be a good choice to infer a representative of a set of graphs. It has been successfully applied to graph-based classification and clustering. Ne...
SODA
2008
ACM
13 years 9 months ago
2008
ACM
Let H be a finite family of graphs. A graph G is H-universal if it contains a copy of each H H as a subgraph. Let H(k, n) denote the family of graphs on n vertices with maximum d...
INFOCOM
2003
IEEE
14 years 26 days ago
2003
IEEE
— Embedding of a graph metric in Euclidean space efficiently and accurately is an important problem in general with applications in topology aggregation, closest mirror selectio...