Finding a potential community in networks
type: Item
instance of: scholarly article
title: Finding a potential community in networks
zbMATH Open document ID: 1421.68064
author: Cristina Bazgan
author: Thomas Pontoizeau
author: Zsolt Tuza
published in: Theoretical Computer Science
publication date: 2019-04-23T00:00:00Z
full work available at URL: Bazgan-Pontoi-Tuza-Finding-a-potential-community.pdf
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 7046890
zbMATH Keywords: graph
zbMATH Keywords: complexity
zbMATH Keywords: algorithm
zbMATH Keywords: independent set
zbMATH Keywords: inapproximability
MaRDI profile type: Publication
OpenAlex ID: W2898526288
cites work: Some APX-completeness results for cubic graphs
cites work: Every planar map is four colorable. I: Discharging
cites work: A partial k-arboretum of graphs with bounded treewidth
cites work: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
cites work: Complement reducible graphs
cites work: A Linear Recognition Algorithm for Cographs
cites work: The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues
cites work: Q3077955
cites work: Fixed-parameter tractability and completeness II: On completeness for W[1]
cites work: Q4931752
cites work: Some simplified NP-complete graph problems
cites work: Efficient algorithms for interval graphs and circular-arc graphs
cites work: A simple linear time algorithm for cograph recognition
cites work: Q5503435
cites work: On Syntactic versus Computational Views of Approximability
cites work: Optimization, approximation, and complexity classes
cites work: Triangles, 4-Cycles and Parameterized (In-)Tractability
cites work: Graph clustering
cites work: Q3002782
Wikidata QID: Q129077865
DOI: 10.1016/J.TCS.2018.10.011
description: scientific article; zbMATH DE number 7046890