91 search results - page 9 / 19 » Pathwidth of outerplanar graphs |
ARSCOM
2008
13 years 7 months ago
2008
COMBINATORICS
1998
13 years 7 months ago
1998
ARSCOM
2005
13 years 7 months ago
2005
Can an arbitrary graph be embedded in Euclidean space so that the isometry group of its vertex set is precisely its graph automorphism group? This paper gives an affirmative answe...
FCT
1995
Springer
13 years 11 months ago
1995
Springer
Abstract. We present algorithms for maintaining shortest path information in dynamic outerplanar digraphs with sublogarithmic query time. By choosing appropriate parameters we achi...
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...