Finding a potential community in networks

Thumbnail
Date
2019
Dewey
Programmation, logiciels, organisation des données
Sujet
Graph; Complexity; Algorithm; Independent set; Inapproximability
Journal issue
Theoretical Computer Science
Volume
769
Publication date
05-2019
Article pages
32-42
Publisher
Elsevier
DOI
http://dx.doi.org/10.1016/j.tcs.2018.10.011
URI
https://basepub.dauphine.fr/handle/123456789/20314
Collections
Metadata
Show full item record
Author
Bazgan, Cristina
989 Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Pontoizeau, Thomas
989 Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Tuza, Zsolt
246630 Department of Computer Science and Systems Technology [Veszprem]
Type
Article accepté pour publication ou publié
Abstract (EN)
An independent 2-clique of a graph is a subset of vertices that is an independent set and such that any two vertices inside have a common neighbor outside. In this paper, we study the complexity of finding an independent 2-clique of maximum size in several graph classes and we compare it with the complexity of maximum independent set.