Finding a potential community in networks

Bazgan, Cristina; Pontoizeau, Thomas; Tuza, Zsolt

Bazgan, Cristina; Pontoizeau, Thomas; Tuza, Zsolt (2019), Finding a potential community in networks, Theoretical Computer Science, 769, p. 32-42. 10.1016/j.tcs.2018.10.011

Type

Article accepté pour publication ou publié

Date

2019

Journal name

Theoretical Computer Science

Volume

769

Publisher

Elsevier

Pages

32-42

Publication identifier

10.1016/j.tcs.2018.10.011

Metadata

Show full item record

Author(s)

Bazgan, Cristina
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Pontoizeau, Thomas
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Tuza, Zsolt
Department of Computer Science and Systems Technology [Veszprem]

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.

Subjects / Keywords

Graph; Complexity; Algorithm; Independent set; Inapproximability