Graph Clustering Via a Discrete Uncoupling Process

DOI10.1137/040608635zbMath1161.68041OpenAlexW2002850151MaRDI QIDQ3609017

Stijn van Dongen

Publication date: 6 March 2009

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/53f31f82557d66b6de06ed749f426f49a78d5435

zbMATH Keywords

circulant matricespositive semi-definite matricesMarkov matrixdiagonal similaritygraph clusteringMarkov graphstochastic uncoupling

Mathematics Subject Classification ID

Applications of graph theory (05C90) Graph theory (including graph drawing) in computer science (68R10) Random matrices (algebraic aspects) (15B52) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (6)

Memory-Efficient Sparse Matrix-Matrix Multiplication by Row Merging on Many-Core Architectures ⋮ Information dynamics algorithm for detecting communities in networks ⋮ Multi-level spectral graph partitioning method ⋮ Experiments on Density-Constrained Graph Clustering ⋮ ViennaCL---Linear Algebra Library for Multi- and Many-Core Architectures ⋮ The parallelism motifs of genomic data analysis

This page was built for publication: Graph Clustering Via a Discrete Uncoupling Process