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 …

There has been significant recent interest in parallel graph processing due to the need to
quickly analyze the large graphs available today. Many graph codes have been designed …

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 …

Maintaining a k-core decomposition quickly in a dynamic graph has important applications
in network analysis. The main challenge for designing efficient exact algorithms is that a …

Matching is an important combinatorial problem with a number of applications in areas such
as community detection, sparse linear algebra, and network alignment. Since computing …

This paper proposes an efficient method for allocating a number of blood centers to a set of
hospitals to minimize the total distance between the hospitals and the blood centers, based …

We survey recent work on approximation algorithms for computing degree-constrained
subgraphs in graphs and their applications in combinatorial scientific computing. The …

We present parallel algorithms for wavelet tree construction with polylogarithmic depth,
improving upon the linear depth of the recent parallel algorithms by Fuentes-Sepulveda et …

In this paper, we give new auction algorithms for maximum weighted bipartite matching
(MWM) and maximum cardinality bipartite $ b $-matching (MCbM). Our algorithms run in …

In recent years, significant advances have been made in the design and analysis of fully
dynamic maximal matching algorithms. However, these theoretical results have received …