Results 301 to 310 of about 47,591 (350)
Some of the next articles are maybe not open access.
Why Is Maximum Clique Often Easy in Practice?
Operational Research, 2020To this day, the maximum clique problem remains a computationally challenging problem. Indeed, despite researchers’ best efforts, there exist unsolved benchmark instances with one thousand vertices.
J. Walteros, Austin Buchanan
semanticscholar +1 more source
Diversified top-k maximal clique detection in Social Internet of Things
Future generations computer systems, 2020Social Internet of Things (SIoT), an IoT where things are autonomously capable of establishing relationships with other smart objects related to humans, allows them to interact within a social structure based on relationships. Importantly, exploiting the
Fei Hao, Zheng Pei, L. Yang
semanticscholar +1 more source
Cliques and clique covers in fuzzy graphs
Journal of Intelligent & Fuzzy Systems, 2016This paper deals with fuzzy clique covers in fuzzy graphs. The definition of a fuzzy clique is modified so that the fuzzy subgraph induced by each fuzzy clique is complete. Then, fuzzy cliques and maximal fuzzy cliques are characterized. Finally, fuzzy clique covers and minimum fuzzy clique covers in fuzzy graphs are introduced and characterized, and ...
Feng Sun 0001 +2 more
openaire +2 more sources
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
Efficient Maximum Clique Computation over Large Sparse Graphs
Knowledge Discovery and Data Mining, 2019This paper studies the problem of MCC-Sparse, Maximum Clique Computation over large real-world graphs that are usually Sparse. In the literature, MCC-Sparse has been studied separately and less extensively than its dense counterpart MCC-Dense, and ...
Lijun Chang
semanticscholar +1 more source
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
A clique-based approach for co-location pattern mining
Information Sciences, 2019Co-location pattern mining refers to the task of discovering the group of features (geographic object types) whose instances (geographic objects) are frequently located close together in a geometric space.
Xuguang Bao, Lizhen Wang
semanticscholar +1 more source
The Landscape of the Planted Clique Problem: Dense subgraphs and the Overlap Gap Property
The Annals of Applied Probability, 2019In this paper we study the computational-statistical gap of the planted clique problem, where a clique of size $k$ is planted in an Erdos Renyi graph $G(n,\frac{1}{2})$ resulting in a graph $G\left(n,\frac{1}{2},k\right)$.
D. Gamarnik, Ilias Zadik
semanticscholar +1 more source
Improved Algorithms for Maximal Clique Search in Uncertain Networks
IEEE International Conference on Data Engineering, 2019Enumerating maximal cliques from an uncertain graph is a fundamental problem in uncertain graph analysis. Given an uncertain graph G, a set of nodes C in G is a maximal (k, τ)-clique if (1) |C|>k and C is a clique with probability at least τ, and (2) C ...
Ronghua Li +5 more
semanticscholar +1 more source
Journal of Graph Theory, 2000
This and the preceding review should be read jointly; the problem considered here is posed by the author as a framing number problem. Let \(f(m,n)\) be the minimum order of a graph where every vertex is in a clique of order \(m\) and every vertex is in an induced independent vertex set of order \(n\). \textit{W.
openaire +2 more sources
This and the preceding review should be read jointly; the problem considered here is posed by the author as a framing number problem. Let \(f(m,n)\) be the minimum order of a graph where every vertex is in a clique of order \(m\) and every vertex is in an induced independent vertex set of order \(n\). \textit{W.
openaire +2 more sources