On the Complexity of Covering Vertices by Faces in a Planar Graph
type: Item
instance of: scholarly article
title: On the Complexity of Covering Vertices by Faces in a Planar Graph
zbMATH Open document ID: 0646.68085
DOI: 10.1137/0217004
author: Daniel Bienstock
author: Clyde l. Monma
published in: SIAM Journal on Computing
publication date: 1988-01-01T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C10
zbMATH DE Number: 4055071
zbMATH Keywords: complexity
zbMATH Keywords: planar graph
zbMATH Keywords: embedding
zbMATH Keywords: polynomial-time recognition algorithm
zbMATH Keywords: Steiner tree
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1137/0217004
OpenAlex ID: W2040444410
description: scientific article