On the complexity of finding a potential community
  • Metaadatok
Tartalom: http://real.mtak.hu/74285/
Archívum: MTA Könyvtár
Gyűjtemény: Status = Published
Type = Book Section
Cím:
On the complexity of finding a potential community
Létrehozó:
Bazgan, Cristina
Pontoizeau, Thomas
Tuza, Zsolt
Közreműködő:
Fotakis, D.
Pagourtzis, A.
Paschos, V. T.
Kiadó:
Springer
Dátum:
2017
Téma:
QA166-QA166.245 Graphs theory / grĂĄfelmĂŠlet
Tartalmi leírás:
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 find-ing an independent 2-clique of maximum size in several graph classes and we compare its complexity with the complexity of maximum independent set. We prove that this problem is NP-hard on apex graphs, APX-hard on line graphs, not n1 /2−-approximable on bipartite graphs and not-approximable on split graphs, while it is polynomial-time solvable on graphs of bounded degree and their complements, graphs of bounded treewidth, planar graphs, (C3, C6)-free graphs, threshold graphs, interval graphs and cographs. © Springer International Publishing AG 2017.
Nyelv:
angol
Típus:
Book Section
NonPeerReviewed
info:eu-repo/semantics/bookPart
Formátum:
text
Azonosító:
Bazgan, Cristina and Pontoizeau, Thomas and Tuza, Zsolt (2017) On the complexity of finding a potential community. In: CIAC 2017: Algorithms and Complexity. Lecture Notes in Computer Science (10236). Springer, Cham, pp. 80-91. ISBN 978-3-319-57585-8
Kapcsolat:
https://doi.org/10.1007/978-3-319-57586-5_8
MTMT:3284192; doi:10.1007/978-3-319-57586-5_8