Results 1  10
of
244,385
Drawing outerplanar graphs using three edge lengths
, 2013
"... It is shown that for any outerplanar graph G there is a one to one mapping of the vertices of G to the plane, so that the number of distinct distances between pairs of connected vertices is at most three. This settles a problem of Carmi, Dujmović, Morin and Wood. The proof combines (elementary) geom ..."
Abstract
 Add to MetaCart
It is shown that for any outerplanar graph G there is a one to one mapping of the vertices of G to the plane, so that the number of distinct distances between pairs of connected vertices is at most three. This settles a problem of Carmi, Dujmović, Morin and Wood. The proof combines (elementary
4. TITLE AND SUBTITLE Proximity Drawings of Outerplanar Graphs
"... Public reporting burden to ' this collection ol Wormatlon ii estimated lo evereoe 1 hour per retponae, Including the time lor reviewing IntI'uctioni. »et'chinj eiltlino deli tou'cei. gelherlng end milnieinlng the del « needed, end completing and reviewing the collection ol Inform ..."
Abstract
 Add to MetaCart
Public reporting burden to ' this collection ol Wormatlon ii estimated lo evereoe 1 hour per retponae, Including the time lor reviewing IntI'uctioni. »et'chinj eiltlino deli tou'cei. gelherlng end milnieinlng the del « needed, end completing and reviewing the collection ol Information. Send comment regardinp this burden estimates or any other asrwct ol this collection ol Wormetion, «eluding eugpestions lor reducing thii burden, lo Washington Headquarters Services, Directorate lor nlormalion Operations end Reports, 1215 JeMerson
Structure And Properties Of Locally Outerplanar Graphs
, 2005
"... This paper studies convex geometric graphs in which no path of length 3 selfintersects. A main result gives a decomposition of such graphs into induced outerplanar graph drawings. The resulting structure theorem is then used to compute a sharp, linear upper bound on the size of the edge set in term ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This paper studies convex geometric graphs in which no path of length 3 selfintersects. A main result gives a decomposition of such graphs into induced outerplanar graph drawings. The resulting structure theorem is then used to compute a sharp, linear upper bound on the size of the edge set
maximal outerplanar
"... A selfstabilizing algorithm for locating the center of Cartesian product of K2 and ..."
Abstract
 Add to MetaCart
A selfstabilizing algorithm for locating the center of Cartesian product of K2 and
Planar Linear Arrangements of Outerplanar Graphs
, 1987
"... Given an nvertex outerplanar graph G I we consider the problem of arranging the vertices of G on a line such that no two edges cross and various cost measures are minimized. We present efficient algorithms for generating layouts in which every edge (i,j) of G does not exceed a given bandwidth b (i, ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
Given an nvertex outerplanar graph G I we consider the problem of arranging the vertices of G on a line such that no two edges cross and various cost measures are minimized. We present efficient algorithms for generating layouts in which every edge (i,j) of G does not exceed a given bandwidth b (i
On the krestricted structure ratio in planar and outerplanar graphs
, 2008
"... A planar krestricted structure is a simple graph whose blocks are planar and each has at most k vertices. Planar krestricted structures are used by approximation algorithms for Maximum Weight Planar Subgraph, which motivates this work. The planar krestricted ratio is the infimum, over simple plan ..."
Abstract
 Add to MetaCart
A planar krestricted structure is a simple graph whose blocks are planar and each has at most k vertices. Planar krestricted structures are used by approximation algorithms for Maximum Weight Planar Subgraph, which motivates this work. The planar krestricted ratio is the infimum, over simple
Generation of Symmetric and Asymmetric Biconnected Rooted Outerplanar Graphs
"... In a rooted graph, a vertex is designated as its root. An outerplanar graph is represented by a plane embedding such that all vertices appear along its outer boundary. Two different plane embeddings of a rooted outerplanar graphs are called symmetric copies. Given integers n ≥ 3 and g ≥ 3, we give a ..."
Abstract
 Add to MetaCart
In a rooted graph, a vertex is designated as its root. An outerplanar graph is represented by a plane embedding such that all vertices appear along its outer boundary. Two different plane embeddings of a rooted outerplanar graphs are called symmetric copies. Given integers n ≥ 3 and g ≥ 3, we give
Results 1  10
of
244,385