Complexity of finding dense subgraphs
type: Item
instance of: scholarly article
title: Complexity of finding dense subgraphs
zbMATH Open document ID: 1002.68108
DOI: 10.1016/S0166-218X(01)00243-8
author: Yuichi Asahiro
author: Refael Hassin
author: Kazuo Iwama
published in: Discrete Applied Mathematics
publication date: 2002-08-29T00:00:00Z
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 1792330
zbMATH Keywords: regular graph
zbMATH Keywords: dense subgraph problem
MaRDI profile type: Publication
cites work: Q4004078
cites work: Q4234075
cites work: Q5687264
cites work: Greedily Finding a Dense Subgraph
cites work: The complexity of theorem-proving procedures
cites work: Maximum dispersion problem in dense graphs
cites work: The dense \(k\)-subgraph problem
cites work: A Fast Parametric Maximum Flow Algorithm and Applications
cites work: Some simplified NP-complete graph problems
cites work: Approximation algorithms for maximum dispersion
cites work: Reducibility among Combinatorial Problems
cites work: Q4130999
cites work: Heuristic and Special Case Algorithms for Dispersion Problems
description: scientific article; zbMATH DE number 1792330