Results 41 to 50 of about 190,829 (309)
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
A Partition of Connected Graphs
The Electronic Journal of Combinatorics, 2005 We define an algorithm $k$ which takes a connected graph $G$ on a totally ordered vertex set and returns an increasing tree $R$ (which is not necessarily a subtree of $G$). We characterize the set of graphs $G$ such that $k(G)=R$. Because this set has a simple structure (it is isomorphic to a product of non-empty power sets), it is easy to evaluate ...
openaire +4 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
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
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
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
PLoS ONE, 2021 In this paper, we present a new method for detecting overlapping communities in networks with a predefined number of clusters called LPAM (Link Partitioning Around Medoids).
Alexander Ponomarenko +2 more
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
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
Deep Multilevel Graph Partitioning
29th Annual European Symposium on Algorithms (ESA 2021), 2021 Partitioning a graph into blocks of "roughly equal" weight while cutting only few edges is a fundamental problem in computer science with a wide range of applications. In particular, the problem is a building block in applications that require parallel processing. While the amount of available cores in parallel architectures has significantly increased
Gottesbüren, Lars +4 more
openaire +7 more sources