Results 251 to 260 of about 34,680 (295)
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Ordering heuristics for k-clique listing
Proceedings of the VLDB Endowment, 2020Listing all k-cliques in a graph is a fundamental graph mining problem that finds many important applications in community detection and social network analysis.
Ronghua Li +5 more
semanticscholar +1 more source
KClist++: A Simple Algorithm for Finding k-Clique Densest Subgraphs in Large Graphs
Proceedings of the VLDB Endowment, 2020The problem of finding densest subgraphs has received increasing attention in recent years finding applications in biology, finance, as well as social network analysis.
Bintao Sun +3 more
semanticscholar +1 more source
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
On Clique-Transversals and Clique-Independent Sets
Annals of Operations Research, 2002zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Durán, Guillermo +2 more
openaire +2 more sources
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
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
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