Results 1 to 10 of about 34,680 (295)
Network clique cover approximation to analyze complex contagions through group interactions [PDF]
Communications Physics, 2021 Contagion processes have been proven to fundamentally depend on the structural properties of the interaction networks conveying them. Many real networked systems are characterized by clustered substructures representing either collections of all-to-all ...
G. Burgio +3 more
semanticscholar +1 more source
Parallel K-clique counting on GPUs [PDF]
International Conference on Supercomputing, 2021 Counting k-cliques in a graph is an important problem in graph analysis with many applications such as community detection and graph partitioning. Counting k-cliques is typically done by traversing search trees starting at each vertex in the graph ...
M. Almasri +4 more
semanticscholar +1 more source
Algorithmic Aspects of Some Variations of Clique Transversal and Clique Independent Sets on Graphs
Algorithms, 2021 This paper studies the maximum-clique independence problem and some variations of the clique transversal problem such as the {k}-clique, maximum-clique, minus clique, signed clique, and k-fold clique transversal problems from algorithmic aspects for k ...
Chuan-Min Lee
doaj +1 more source
The Power of Pivoting for Exact Clique Counting [PDF]
Web Search and Data Mining, 2020 Clique counting is a fundamental task in network analysis, and even the simplest setting of $3$-cliques (triangles) has been the center of much recent research.
Shweta Jain, C. Seshadhri
semanticscholar +1 more source
Social and Spatial Representations of the Nerd in Donnie Darko
Exchanges, 2022 The nerds of 20th and 21st century global pop and visual culture have taken various forms over the decades. In a plethora of media - from video games to comic books to film - individuals associated with this subject position have typically been shown to
Kwasu David Tembo
doaj +1 more source
Parallel Clique Counting and Peeling Algorithms [PDF]
Conference on Applied and Computational Discrete Algorithms, 2020 Dense subgraphs capture strong communities in social networks and entities possessing strong interactions in biological networks. In particular, $k$-clique counting and listing have applications in identifying important actors in a graph.
Jessica Shi +2 more
semanticscholar +1 more source
A Spatial Fuzzy Co-Location Pattern Mining Method Based on Interval Type-2 Fuzzy Sets
Applied Sciences, 2022 The goal of spatial co-location pattern mining is to find subsets of spatial features whose instances are often neighbors in a geographical space. In many practical cases, instances of spatial features contain not only spatial location information but ...
Jinyu Guo, Lizhen Wang
doaj +1 more source
Scalable Activation of Rare Triggers in Hardware Trojans by Repeated Maximal Clique Sampling
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2021 Hardware Trojans are serious threat to security and reliability of computing systems. It is hard to detect these malicious implants using traditional validation methods since an adversary is likely to hide them under rare trigger conditions.
Yangdi Lyu, P. Mishra
semanticscholar +1 more source
Measurement optimization in the variational quantum eigensolver using a minimum clique cover. [PDF]
Journal of Chemical Physics, 2019 Solving the electronic structure problem using the Variational Quantum Eigensolver (VQE) technique involves the measurement of the Hamiltonian expectation value.
Vladyslav Verteletskyi +2 more
semanticscholar +1 more source
Clique Search in Graphs of Special Class and Job Shop Scheduling
Mathematics, 2022 In this paper, we single out the following particular case of the clique search problem. The vertices of the given graph are legally colored with k colors and we are looking for a clique with k nodes in the graph.
Sándor Szabó, Bogdán Zaválnij
doaj +1 more source