Results 1 to 10 of about 135,517 (136)
k-Clique counting on large scale-graphs: a survey [PDF]
PeerJ Computer ScienceClique counting is a crucial task in graph mining, as the count of cliques provides different insights across various domains, social and biological network analysis, community detection, recommendation systems, and fraud detection.
Büşra Çalmaz +1 more
doaj +3 more sources
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
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
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
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
Estudo do número de Ramsey R(3,10): análise de grafos de ordem 40
REMAT, 2023 O número de Ramsey R(k,l) é o menor número inteiro n tal que não exista (k,l,n,e)-grafo, sendo que um (k,l,n,e)-grafo denota um grafo G com n vértices e e arestas e com C(G)
Daniel Coswig Zitzke +3 more
doaj +3 more sources
Clique Transversal Variants on Graphs: A Parameterized-Complexity Perspective
Mathematics, 2023 The clique transversal problem and its variants have garnered significant attention in the last two decades due to their practical applications in communication networks, social-network theory and transceiver placement for cellular telephones.
Chuan-Min Lee
doaj +1 more source
Development of Stock Networks Using Part Mutual Information and Australian Stock Market Data
Entropy, 2020 Complex network is a powerful tool to discover important information from various types of big data. Although substantial studies have been conducted for the development of stock relation networks, correlation coefficient is dominantly used to measure ...
Yan Yan +3 more
doaj +1 more source
Circuit design for clique problem and its implementation on quantum computer
IET Quantum Communication, 2022 Finding cliques in a graph has a wide range of applications due to its pattern matching ability. The k‐clique problem, a subset of the clique problem, determines whether or not an arbitrary network has a clique of size k.
Arpita Sanyal Bhaduri +3 more
doaj +1 more source
Using Multidimensional Matrices to Determine Graph Properties
Современные информационные технологии и IT-образование, 2022 The need to determine the most appropriate data model increases, as the complexity of the designed computing systems and computer networks increases. The graph model is one of the main models for this kind of tasks.
Aleksandr Makarov, Victor Munerman
doaj +1 more source