Complexity and approximability of the k‐way vertex cut
type: Item
instance of: scholarly article
title: Complexity and approximability of the k‐way vertex cut
zbMATH Open document ID: 1386.05148
author: André Berger
author: Alexander Grigoriev
author: Ruben van der Zwaan
published in: Networks
publication date: 2018-05-11T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 6867786
zbMATH Keywords: planar graph
zbMATH Keywords: separator
zbMATH Keywords: connectivity
zbMATH Keywords: computational complexity
zbMATH Keywords: approximation scheme
MaRDI profile type: Publication
full work available at URL: net.21534
OpenAlex ID: W2044757908
Wikidata QID: Q57338948
DOI: 10.1002/NET.21534
description: scientific article; zbMATH DE number 6867786