On the complexity of embedding planar graphs to minimize certain distance measures
type: Item
instance of: scholarly article
title: On the complexity of embedding planar graphs to minimize certain distance measures
zbMATH Open document ID: 0689.68044
DOI: 10.1007/BF01840379
author: Clyde l. Monma
author: Daniel Bienstock
published in: Algorithmica
publication date: 1990-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 03D15
zbMATH DE Number: 4129996
zbMATH Keywords: embedding
zbMATH Keywords: planar graphs
zbMATH Keywords: outer faces
MaRDI profile type: Publication
cites work: On the Complexity of Covering Vertices by Faces in a Planar Graph
cites work: Optimal enclosing regions in planar graphs
cites work: Q4198056
cites work: Q3880849
cites work: Graph minors. III. Planar tree-width
cites work: Dividing a Graph into Triconnected Components
cites work: Q4111952
description: scientific article; zbMATH DE number 4129996