Approximation of satisfactory bisection problems
type: Item
instance of: scholarly article
title: Approximation of satisfactory bisection problems
zbMATH Open document ID: 1140.68050
author: Cristina Bazgan
author: Zsolt Tuza
author: Daniel Vanderpooten
published in: Journal of Computer and System Sciences
publication date: 2008-06-26T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 5293396
zbMATH Keywords: graph
zbMATH Keywords: vertex partition
zbMATH Keywords: degree constraints
zbMATH Keywords: complexity
zbMATH Keywords: NP-completeness
zbMATH Keywords: approximation algorithm
MaRDI profile type: Publication
full work available at URL: j.jcss.2007.12.001
OpenAlex ID: W2023844733
cites work: Graph partitions with minimum degree constraints
cites work: The satisfactory partition problem
cites work: Paths, Trees, and Flowers
cites work: Q5508779
cites work: Q4198056
cites work: Algorithmic approach to the satisfactory graph partitioning problem
cites work: The hardness of approximation: Gap location
cites work: Graph decomposition with constraints in the minimum degree
cites work: Balanced graphs with minimum degree constraints
cites work: Graphical decompositions
cites work: Graph decomposition with constraints on the connectivity and minimum degree
DOI: 10.1016/J.JCSS.2007.12.001
description: scientific article; zbMATH DE number 5293396