ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

2-Connecting outerplanar graphs without blowing up the pathwidth

Babu, Jasine and Basavaraju, Manu and Chandran, Sunil L and Rajendraprasad, Deepak (2014) 2-Connecting outerplanar graphs without blowing up the pathwidth. In: 19th Annual International Computing and Combinatorics Conference (COCOON, JUN, 2013, Hanhzhou, PEOPLES R CHINA, pp. 119-134.

[img] PDF
the_com_sci_554_119_2014.pdf - Published Version
Restricted to Registered users only

Download (413kB) | Request a copy
Official URL: http://dx.doi.org/ 10.1016/j.tcs.2014.04.032


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. (C) 2014 Elsevier B.V. All rights reserved.

Item Type: Conference Proceedings
Additional Information: Copy right for this article belongs to the ELSEVIER SCIENCE BV, PO BOX 211, 1000 AE AMSTERDAM, NETHERLANDS
Keywords: Pathwidth; Outerplanar graph; 2-Vertex-connected
Department/Centre: Division of Electrical Sciences > Computer Science & Automation
Date Deposited: 28 Nov 2014 04:54
Last Modified: 28 Nov 2014 04:54
URI: http://eprints.iisc.ac.in/id/eprint/50331

Actions (login required)

View Item View Item