684 search results - page 11 / 137 » On embedding well-separable graphs |
120
click to vote
PAMI
2012
13 years 2 days ago
2012
Abstract—Given the size and confidence of pairwise local orderings, angular embedding (AE) finds a global ordering with a nearglobal optimal eigensolution. As a quadratic crite...
COCOON
1999
Springer
15 years 1 months ago
1999
Springer
Abstract. Hierarchical graphs are an important class of graphs for modelling many real applications in software and information visualization. In this paper, we shall investigate t...
116
click to vote
COMGEO
2011
ACM
14 years 4 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 ...
DM
2002
14 years 9 months ago
2002
Let G be a planar embedded 2-connected graph. Then the vertices of its resonance graph R(G) are the 1-factors of G, two 1-factors being adjacent whenever their symmetric differenc...
71
Voted
COMGEO
2007
ACM
14 years 9 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...