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
|
Text
FindComm_Bazgan_et_al_u.pdf Download (320kB) | Preview |
Abstract
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.
| Item Type: | Book Section |
|---|---|
| Uncontrolled Keywords: | Graph theory; THRESHOLD GRAPHS; Polynomial-time; Maximum independent sets; Bounded treewidth; Bipartite graphs; Polynomial approximation; Optimization; Graphic methods; Computational complexity; Algorithms; Independent set; Inapproximability; COMPLEXITY; Combinatorial optimization; ALGORITHM |
| Subjects: | Q Science / természettudomány > QA Mathematics / matematika > QA166-QA166.245 Graphs theory / gráfelmélet |
| SWORD Depositor: | MTMT SWORD |
| Depositing User: | MTMT SWORD |
| Date Deposited: | 12 Feb 2018 07:40 |
| Last Modified: | 12 Feb 2018 07:40 |
| URI: | http://real.mtak.hu/id/eprint/74285 |
Actions (login required)
 |
Edit Item |
