More recent advances in (hyper) graph partitioning
In recent years, significant advances have been made in the design and evaluation of
balanced (hyper) graph partitioning algorithms. We survey trends of the past decade in …
balanced (hyper) graph partitioning algorithms. We survey trends of the past decade in …
[图书][B] Recent advances in graph partitioning
Recent Advances in Graph Partitioning | SpringerLink Skip to main content Advertisement
SpringerLink Account Menu Find a journal Publish with us Track your research Search Cart …
SpringerLink Account Menu Find a journal Publish with us Track your research Search Cart …
[图书][B] A first course in network science
Networks are everywhere: networks of friends, transportation networks and the Web.
Neurons in our brains and proteins within our bodies form networks that determine our …
Neurons in our brains and proteins within our bodies form networks that determine our …
Think locally, act globally: Highly balanced graph partitioning
We present a novel local improvement scheme for graph partitions that allows to enforce
strict balance constraints. Using negative cycle detection algorithms this scheme combines …
strict balance constraints. Using negative cycle detection algorithms this scheme combines …
High-quality hypergraph partitioning
Hypergraphs are a generalization of graphs where edges (aka nets) are allowed to connect
more than two vertices. They have a similarly wide range of applications as graphs. This …
more than two vertices. They have a similarly wide range of applications as graphs. This …
Parallel graph partitioning for complex networks
H Meyerhenke, P Sanders… - IEEE Transactions on …, 2017 - ieeexplore.ieee.org
Processing large complex networks like social networks or web graphs has attracted
considerable interest. To do this in parallel, we need to partition them into pieces of roughly …
considerable interest. To do this in parallel, we need to partition them into pieces of roughly …
Engineering parallel algorithms for community detection in massive networks
CL Staudt, H Meyerhenke - IEEE Transactions on Parallel and …, 2015 - ieeexplore.ieee.org
The amount of graph-structured data has recently experienced an enormous growth in many
applications. To transform such data into useful information, fast analytics algorithms and …
applications. To transform such data into useful information, fast analytics algorithms and …
Microgrid topology planning for enhancing the reliability of active distribution networks
CA Cortes, SF Contreras… - IEEE Transactions on …, 2017 - ieeexplore.ieee.org
Loop-based microgrids are signified by their high reliability in islanded and grid-connected
operations. This paper proposes an iterative procedure for the optimal design of a microgrid …
operations. This paper proposes an iterative procedure for the optimal design of a microgrid …
Optimal planning of loop-based microgrid topology
In microgrid planning, topological design is a critical concern for ensuring certain features
such as high reliability in islanded operation. This paper proposes a graph partitioning and …
such as high reliability in islanded operation. This paper proposes a graph partitioning and …
Application driven graph partitioning
Graph partitioning is crucial to parallel computations on large graphs. The choice of
partitioning strategies has strong impact on not only the performance of graph algorithms …
partitioning strategies has strong impact on not only the performance of graph algorithms …