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 …
Ja-be-ja: A distributed algorithm for balanced graph partitioning
Balanced graph partitioning is a well known NP-complete problem with a wide range of
applications. These applications include many large-scale distributed problems including …
applications. These applications include many large-scale distributed problems including …
Incrementalization of graph partitioning algorithms
This paper studies incremental graph partitioning. Given a (vertex-cut or edge-cut) partition
C (G) of a graph G and updates ΔG to G, it is to compute changes ΔO to C (G), yielding a …
C (G) of a graph G and updates ΔG to G, it is to compute changes ΔO to C (G), yielding a …
Graph partitioning algorithms for optimizing software deployment in mobile cloud computing
As cloud computing is gaining popularity, an important question is how to optimally deploy
software applications on the offered infrastructure in the cloud. Especially in the context of …
software applications on the offered infrastructure in the cloud. Especially in the context of …
A lock-free priority queue design based on multi-dimensional linked lists
The throughput of concurrent priority queues is pivotal to multiprocessor applications such
as discrete event simulation, best-first search and task scheduling. Existing lock-free priority …
as discrete event simulation, best-first search and task scheduling. Existing lock-free priority …
A distributed algorithm for large-scale graph partitioning
Balanced graph partitioning is an NP-complete problem with a wide range of applications.
These applications include many large-scale distributed problems, including the optimal …
These applications include many large-scale distributed problems, including the optimal …