On the two-connected planar spanning subgraph polytope
type: Item
instance of: scholarly article
title: On the two-connected planar spanning subgraph polytope
zbMATH Open document ID: 0895.05018
DOI: 10.1016/S0166-218X(97)00087-5
author: Caterina De Simone
author: Michael Jünger
published in: Discrete Applied Mathematics
publication date: 1998-03-25T00:00:00Z
full work available at URL: dam
review text: The authors investigate the problem of finding a two-connected spanning planar subgraph of maximum weight in a complete edge-weighted graph, from a polyhedral point of view. The problem is important in automatic graph drawing.
Mathematics Subject Classification ID: 05C10
zbMATH DE Number: 1133174
zbMATH Keywords: spanning planar subgraph
zbMATH Keywords: graph drawing
reviewed by: Arthur T. White
MaRDI profile type: Publication
cites work: Q3941433
cites work: `` Strong '' NP-Completeness Results
cites work: A polyhedral approach to planar augmentation and related problems
cites work: Q3818127
cites work: Q4845372
OpenAlex ID: W1991327498
description: scientific article; zbMATH DE number 1133174