Back to Search
Start Over
2-Connecting outerplanar graphs without blowing up the pathwidth.
- Source :
-
Theoretical Computer Science . Oct2014, Vol. 554, p119-134. 16p. - Publication Year :
- 2014
-
Abstract
- Given a connected outerplanar graph G of pathwidth p , we give an algorithm to add edges to G to get a supergraph of G , which is 2-vertex-connected, outerplanar and of pathwidth O ( p ) . This settles an open problem raised by Biedl [1] , in the context of computing minimum height planar straight line drawings of outerplanar graphs, with their vertices placed on a two-dimensional grid. In conjunction with the result of this paper, the constant factor approximation algorithm for this problem obtained by Biedl [1] for 2-vertex-connected outerplanar graphs will work for all outer planar graphs. [ABSTRACT FROM AUTHOR]
- Subjects :
- *GRAPH theory
*ALGORITHMS
*PLANAR graphs
*COMPUTER science
*INFORMATION science
Subjects
Details
- Language :
- English
- ISSN :
- 03043975
- Volume :
- 554
- Database :
- Academic Search Index
- Journal :
- Theoretical Computer Science
- Publication Type :
- Academic Journal
- Accession number :
- 98575662
- Full Text :
- https://doi.org/10.1016/j.tcs.2014.04.032