Results 31 to 40 of about 197,409 (310)
Frequency and voltage partitioning in presence of renewable energy resources for power system (example: North Chile power network) [PDF]
, 2016 This paper investigates techniques for frequency and voltage partitioning of power network based on the graph-theory. These methods divide the power system into distinguished regions to avoid the spread of disturbances and to minimize the interaction ...
Al-Emadi, N. A. +3 more
core +1 more source
Partitioned Probe Comparability Graphs
Theoretical Computer Science, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chandler, David B. +4 more
openaire +1 more source
Summary of Large-Scale Grapb Partitioning Algoritbms
Dianxin kexue, 2014 The large-scale graph partitioning algorithms were summarized and graph computing models in the distributed environment were introduced. Firstly the large-scale static graph partitioning algorithms and the dynamic graph partitioning algorithms were ...
Jinfeng Xu +4 more
doaj +2 more sources
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
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
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
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
Consistency of Spectral Hypergraph Partitioning under Planted Partition Model
, 2016 Hypergraph partitioning lies at the heart of a number of problems in machine learning and network sciences. Many algorithms for hypergraph partitioning have been proposed that extend standard approaches for graph partitioning to the case of hypergraphs ...
Dukkipati, Ambedkar +1 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