Recent Advances in Graph Partitioning
Aydin Buluc,Henning Meyerhenke,Ilya Safro,Peter Sanders,Christian Schulz +4 more
- 01 Nov 2016
- pp 117-158
TL;DR: In this article, the authors survey recent trends in practical algorithms for balanced graph partitioning, point to applications, and discuss future research directions, and present a survey of the most popular algorithms.
read more
Abstract: We survey recent trends in practical algorithms for balanced graph partitioning, point to applications and discuss future research directions.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Posted Content
Scene Text Detection via Holistic, Multi-Channel Prediction
TL;DR: This work proposes to localize text in a holistic manner, by casting scene text detection as a semantic segmentation problem, and demonstrates that the proposed algorithm substantially outperforms previous state-of-the-art approaches.
273
The Critical Node Detection Problem in networks: A survey.
TL;DR: This survey reviews, classify and discusses several recent advances and results obtained for each variant, including theoretical complexity, exact solving algorithms, approximation schemes and heuristic approaches, and proves new complexity results and induce some solving algorithms through relationships established between different variants.
262
Graph Partitioning using Quantum Annealing on the D-Wave System
Hayato Ushijima-Mwesigwa,Christian F. A. Negre,Susan M. Mniszewski +2 more
- 12 Nov 2017
TL;DR: Results for graph partitioning using quantum and hybrid classical-quantum approaches are shown to be comparable to current "state of the art" methods and sometimes better.
Cluster-Based Radio Resource Management for D2D-Supported Safety-Critical V2X Communications
TL;DR: This paper transforms the V2X requirements into the constraints that are computable using slowly varying channel state information only, and formulates an optimization problem, taking into account the requirements of both vehicular users and cellular users, and proposes a heuristic algorithm, called Cluster-based Resource block sharing and pOWer allocatioN (CROWN).
213
A Survey on Controller Placement in SDN
TL;DR: A comprehensive survey on the controller placement problem (CPP) in SDN is presented and the classical CPP formulation along with its supporting system model is presented.
197
References
•Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
Michael Randolph Garey,David S. Johnson +1 more
- 01 Jan 1979
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
MapReduce: simplified data processing on large clusters
Jeffrey Dean,Sanjay Ghemawat +1 more
- 06 Dec 2004
TL;DR: This paper presents the implementation of MapReduce, a programming model and an associated implementation for processing and generating large data sets that runs on a large cluster of commodity machines and is highly scalable.
Least squares quantization in PCM
TL;DR: In this article, the authors derived necessary conditions for any finite number of quanta and associated quantization intervals of an optimum finite quantization scheme to achieve minimum average quantization noise power.
•Book
Networks: An Introduction
Mark Newman
- 25 Mar 2010
TL;DR: This book brings together for the first time the most important breakthroughs in each of these fields and presents them in a coherent fashion, highlighting the strong interconnections between work in different areas.
11.8K