Results 271 to 280 of about 34,680 (295)
Some of the next articles are maybe not open access.
Computational Challenges with Cliques, Quasi-cliques and Clique Partitions in Graphs
2010During the last decade, many problems in social, biological, and financial networks require finding cliques, or quasi-cliques. Cliques or clique partitions have also been used as clustering or classification tools in data sets represented by networks.
Panos M. Pardalos, Steffen Rebennack
openaire +1 more source
Clique-Detection Algorithm Using Clique-Self-Assembly
2011 Sixth International Conference on Bio-Inspired Computing: Theories and Applications, 2011Self-assembly is a process in which simple objects autonomously combine themselves into larger objects. It is considered as a promising technique in nano-technology. Two simple graphs G1 and G2 with a clique of same size overlap and a new self-assembled graph is formed.
R. Rama +2 more
openaire +1 more source
Enumeration of isolated cliques and pseudo-cliques
ACM Transactions on Algorithms, 2009In this article, we consider isolated cliques and isolated dense subgraphs. For a given graph G , a vertex subset S of size k (and also its induced subgraph G ( S )) is said
Hiro Ito, Kazuo Iwama
openaire +1 more source
M-cliques: modified cliques key agreement for secure multicast
Canadian Conference on Electrical and Computer Engineering, 2005., 2006In a secured multicast application, members may join or leave frequently and key management is one of the most challenging problems. In this paper, we proposed M-CLIQUES key management protocol. It is the modification of CLIQUES that consists of two stages.
Xiaoyan Chen +2 more
openaire +1 more source
A Fast and Provable Method for Estimating Clique Counts Using Turán's Theorem
The Web Conference, 2016Clique counts reveal important properties about the structure of massive graphs, especially social networks. The simple setting of just 3-cliques (triangles) has received much attention from the research community. For larger cliques (even, say 6-cliques)
Shweta Jain, C. Seshadhri
semanticscholar +1 more source
International Journal of Applied Metaheuristic Computing, 2022
The Maximum Clique Problem (MCP) is a classical NP-hard problem that has gained considerable attention due to its numerous real-world applications and theoretical complexity. It is inherently computationally complex, and so exact methods may require prohibitive computing time. Nature-inspired meta-heuristics have proven their utility in solving many NP-
openaire +1 more source
The Maximum Clique Problem (MCP) is a classical NP-hard problem that has gained considerable attention due to its numerous real-world applications and theoretical complexity. It is inherently computationally complex, and so exact methods may require prohibitive computing time. Nature-inspired meta-heuristics have proven their utility in solving many NP-
openaire +1 more source
Factoring and weighting approaches to status scores and clique identification
, 1972P. Bonacich
semanticscholar +1 more source
Index-Based Densest Clique Percolation Community Search in Networks
IEEE Transactions on Knowledge and Data Engineering, 2018Long Yuan +4 more
semanticscholar +1 more source