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

[thumbnail of zpr96-229.pdf]
Preview
 PDF
zpr96-229.pdf - Draft Version
Download (188kB) | Preview

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.

Item Type: Article
Creators:
Creators
Email
ORCID
ORCID Put Code
Simone, Caterina De
UNSPECIFIED
UNSPECIFIED
UNSPECIFIED
Jünger, Michael
UNSPECIFIED
UNSPECIFIED
UNSPECIFIED
URN: urn:nbn:de:hbz:38-547526
Journal or Publication Title: Discrete Applied Mathematics
Volume: 80
Number: 2-3
Page Range: pp. 223-229
Date: 1997
Publisher: Elsevier Science
Language: English
Faculty: Faculty of Mathematics and Natural Sciences
Divisions: Faculty of Mathematics and Natural Sciences > Department of Mathematics and Computer Science > Institute of Computer Science
Subjects: Data processing Computer science
Refereed: No
URI: http://kups.ub.uni-koeln.de/id/eprint/54752

Downloads

Downloads per month over past year

Export

Actions (login required)

View Item View Item