Beyond good partition shapes: an analysis of diffusive graph partitioning
type: Item
instance of: scholarly article
title: Beyond good partition shapes: an analysis of diffusive graph partitioning
zbMATH Open document ID: 1257.05131
author: Henning Meyerhenke
author: Thomas Sauerwald
published in: Algorithmica
publication date: 2013-01-28T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C81
Mathematics Subject Classification ID: 05C90
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 6131862
zbMATH Keywords: diffusive graph partitioning
zbMATH Keywords: relaxed cut optimization
zbMATH Keywords: disturbed diffusion
zbMATH Keywords: random walks
describes a project that uses: PT-Scotch
describes a project that uses: Graclus
describes a project that uses: Bubble-FOS/C
describes a project that uses: DibaP
MaRDI profile type: Publication
full work available at URL: s00453-012-9666-y
OpenAlex ID: W1995006434
cites work: Finding sparse cuts locally using evolving sets
cites work: Balanced graph partitioning
cites work: Q3134873
cites work: Randomized diffusion for indivisible loads
cites work: Q4279611
cites work: Asymptotic analysis of a random walk on a hypercube with many dimensions
cites work: Efficient schemes for nearest neighbor load balancing
cites work: Q3706275
cites work: Balanced partitions of trees and applications
cites work: Q3877805
cites work: Q4198056
cites work: Q2716030
cites work: Q5689624
cites work: Probability and random processes.
cites work: An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
cites work: Parallel Multilevel series k-Way Partitioning Scheme for Irregular Graphs
cites work: Q4094202
cites work: An Efficient Heuristic Procedure for Partitioning Graphs
cites work: Q4002466
cites work: Least squares quantization in PCM
cites work: Disturbed diffusive processes for solving partitioning problems on graphs
cites work: Beyond Good Shapes: Diffusion-Based Graph Partitioning Is Relaxed Cut Optimization
cites work: Analyzing Disturbed Diffusion on Networks
cites work: Q3549709
cites work: Machine Learning: ECML 2004
cites work: Graph clustering
cites work: Q4337625
DOI: 10.1007/S00453-012-9666-Y
description: scientific article; zbMATH DE number 6131862