Results 31 to 40 of about 193,029 (263)
Query-Sensitive Graph Partitioner for Pattern Matching Applications
IEEE Access, 2019 Searching and mining in large graphs is critical to a variety of applications, at the core of which is the pattern matching activity. The scalable processing of large graphs requires careful distribution of graphs across clusters.
Li Lu, Bei Hua
doaj +1 more source
Hypergraph partitioning using tensor eigenvalue decomposition.
PLoS ONE, 2023 Hypergraphs have gained increasing attention in the machine learning community lately due to their superiority over graphs in capturing super-dyadic interactions among entities.
Deepak Maurya, Balaraman Ravindran
doaj +1 more source
(Semi-)External Algorithms for Graph Partitioning and Clustering
, 2014 In this paper, we develop semi-external and external memory algorithms for graph partitioning and clustering problems. Graph partitioning and clustering are key tools for processing and analyzing large complex networks.
Akhremtsev, Yaroslav +2 more
core +1 more source
Parallel Graph Partitioning for Complex Networks [PDF]
, 2015 Processing large complex networks like social networks or web graphs has recently attracted considerable interest. In order to do this in parallel, we need to partition them into pieces of about equal size.
Meyerhenke, Henning +2 more
core +1 more source
SIAM Journal on Discrete MathematicsGiven a finite set of points in $\mathbb{R}^d$, Tverberg's theorem guarantees the existence of partitions of this set into parts whose convex hulls intersect. We introduce a graph structured on the family of Tverberg partitions of a given set of points, whose edges describe closeness between different Tverberg partitions. We prove bounds on the minimum
Deborah Oliveros +3 more
openaire +3 more sources
Parallel Heuristics for Balanced Graph Partitioning Based on Richness of Implicit Knowledge
IEEE Access, 2019 Balanced graph partitioning (BGP) has a wide range of applications that involve many large-scale distributed data processing problems. However, most of the existing approaches to parallel graph partitioning neglect the problem of the richness of implicit
Zhipeng Yang +2 more
doaj +1 more source
Enhanced adaptive partitioning in a distributed graph database
Journal of Information and Telecommunication, 2021 Nowadays, open-source graph databases do not include an inherent mechanism for data relocation that would be based on their usage. They often do not offer even appropriate monitoring that could help to make such a decision.
Lucie Svitáková +2 more
doaj +1 more source
Graph Partitioning Induced Phase Transitions
, 2007 We study the percolation properties of graph partitioning on random regular graphs with N vertices of degree $k$. Optimal graph partitioning is directly related to optimal attack and immunization of complex networks.
A. Bekessy +14 more
core +1 more source
Partitioning Graph Clustering With User-Specified Density
IEEE Access, 2023 Graph clustering has attracted many interests in recent years, with numerous applications ranging from the clustering of computer networks to the detection of social communities.
Rohi Tariq +3 more
doaj +1 more source
Journal of King Saud University: Computer and Information Sciences, 2019 In a distributed environment, the volume of graph database increases quickly because graphs emerge from several autonomous sources. Sub-graph query processing is a challenging problem in distributed environment.
Shaik Fathimabi +2 more
doaj +1 more source