On the Two-Connected Planar Spanning Subgraph Polytope

Simone, Caterina De and Jünger, Michael (1997) On the Two-Connected Planar Spanning Subgraph Polytope.
Published in: Discrete Applied Mathematics Vol. 80 (2-3). pp. 223-229.

Abstract

The problem of finding in a complete edge-weighted graph a two-connected planar spanning subgraph of maximum weight is important in automatic graph drawing. We investigate the problem from a polyhedral point of view.


Actions:
Download: [img] Postscript - Preprinted Version
Download (233kB) | Preview
Export as: [error in script]
Editorial actions: View Item View Item (Login required)
Content information:
Item Type: Article
Citations: [error in script] 2 (Google Scholar) | [error in script]
Uncontrolled Keywords: [error in script]
Subjects:
Uncontrolled Keywords: facets, planar graphs, polyhedra, two-connected graphs
Subjects: UNSPECIFIED
Divisions: Institute of Computer Science > Computer Science Department - Prof. Dr. Juenger
Depositing User: Prof. Dr. Michael Jünger
Date Deposited: 08 May 2003 00:00
Last Modified: 19 Jan 2012 09:41
Deposit Information:
ZAIK Number: [error in script]
Depositing User: Prof. Dr. Michael Jünger
Date Deposited: 08 May 2003 00:00
Last Modified: 19 Jan 2012 09:41
URI: http://e-archive.informatik.uni-koeln.de/id/eprint/229