Results 31 to 40 of about 34,680 (295)
A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem [PDF]
IEEE Annual Symposium on Foundations of Computer Science, 2016 We prove that with high probability over the choice of a random graph G from the Erdös-Rényi distribution G(n,1/2), the nO(d)-time degree d Sum-of-Squares semidefinite programming relaxation for the clique problem will give a value of at least n1/2-c(d/
B. Barak +5 more
semanticscholar +1 more source
Studi Fenomenologi Identitas Diri Anggota Clique
Jurnal Psikoedukasi dan Konseling, 2022 : This study aims to determine the meaning of forming the self-identity of students who are members of a clique at school. This study uses a qualitative method with a phenomenological approach.
Sylva Indah Kirana +2 more
doaj +1 more source
Clique-Width for Hereditary Graph Classes [PDF]
BCC, 2019 Clique-width is a well-studied graph parameter owing to its use in understanding algorithmic tractability: if the clique-width of a graph class ${\cal G}$ is bounded by a constant, a wide range of problems that are NP-complete in general can be shown to ...
Konrad K. Dabrowski +2 more
semanticscholar +1 more source
How Many Cliques Can a Clique Cover Cover?
The Electronic Journal of Combinatorics, 2023 This work examines the problem of clique enumeration on a graph by exploiting its clique covers. The principle of inclusion/exclusion is applied to determine the number of cliques of size $r$ in the graph union of a set $\mathcal{C} = \{c_1, \ldots, c_m\}$ of $m$ cliques. This leads to a deeper examination of the sets involved and to an orbit partition,
Shuldiner, Pavel, Oldford, R. Wayne
openaire +3 more sources
From Gap-ETH to FPT-Inapproximability: Clique, Dominating Set, and More [PDF]
IEEE Annual Symposium on Foundations of Computer Science, 2017 We consider questions that arise from the intersection between theareas of approximation algorithms, subexponential-time algorithms, and fixed-parameter tractable algorithms.
Parinya Chalermsook +6 more
semanticscholar +1 more source
Broadcast Congested Clique [PDF]
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019 We develop techniques to prove lower bounds for the BCAST(log n) Broadcast Congested Clique model (a distributed message passing model where in each round, each processor can broadcast an O(log n)-sized message to all other processors). Our techniques are built to prove bounds for natural input distributions.
Chen, Lijie, Grossman, Ofer
openaire +2 more sources
Maxclique and Unit Disk Characterizations of Strongly Chordal Graphs
Discussiones Mathematicae Graph Theory, 2014 Maxcliques (maximal complete subgraphs) and unit disks (closed neighborhoods of vertices) sometime play almost interchangeable roles in graph theory. For instance, interchanging them makes two existing characterizations of chordal graphs into two new ...
Caria Pablo De, McKee Terry A.
doaj +1 more source
Clique densification in networks
Physical Review E, 2023 14 pages, 11 figures.
Haochen Pi +3 more
openaire +3 more sources
Exploring Small-World Network with an Elite-Clique: Bringing Embeddedness Theory into the Dynamic Evolution of a Venture Capital Network [PDF]
Soc. Networks, 2018 This paper uses a network dynamics model to explain the formation of a small-world network with an elite-clique. This network is a small-world network with an elite-clique at its center in which elites are also the centers of many small groups.
Weiwei Gu, Jar-der Luo, Jifan Liu
semanticscholar +1 more source
On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs [PDF]
Discrete Applied Mathematics, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alcón, Liliana Graciela +3 more
openaire +2 more sources