Partitioning a graph into minimum gap components
type: Item
instance of: scholarly article
title: Partitioning a graph into minimum gap components
zbMATH Open document ID: 1356.05104
author: Maurizio Bruglieri
author: Roberto Cordone
publication date: 2017-02-14T00:00:00Z
full work available at URL: http://hdl.handle.net/11311/1003476
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C22
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 6684433
zbMATH Keywords: graph partitioning
zbMATH Keywords: computational complexity
zbMATH Keywords: approximability
MaRDI profile type: Publication
OpenAlex ID: W2555427973
cites work: Graph Partitioning and Graph Clustering
DOI: 10.1016/J.ENDM.2016.10.009
Recommended article: Q4552255
Recommended article: Graph partitions with minimum degree constraints
Recommended article: Partitioning into graphs with only small components
Recommended article: Partitioning graphs into connected parts
Recommended article: Partitioning Graphs into Connected Parts
Recommended article: Max-min partitioning of grid graphs into connected components
Recommended article: Graph partitioning
Recommended article: Q4304346
Recommended article: Partitioning a k-connected graph
Recommended article: Partitioning graphs into complete and empty graphs
description: scientific article; zbMATH DE number 6684433