Graph Partitioning via Adaptive Spectral Techniques
type: Item
instance of: scholarly article
title: Graph Partitioning via Adaptive Spectral Techniques
zbMATH Open document ID: 1209.05178
DOI: 10.1017/S0963548309990514
author: Amin Coja-Oghlan
published in: Combinatorics, Probability and Computing
publication date: 2010-04-23T00:00:00Z
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 5700350
MaRDI profile type: Publication
cites work: Partitioning Sparse Matrices with Eigenvectors of Graphs
cites work: General paritioning on random graphs
cites work: The Largest Eigenvalue of Sparse Random Graphs
cites work: On clusterings
cites work: Sparse quasi-random graphs
cites work: The Metropolis algorithm for graph bisection
cites work: Quick approximation to matrices and applications
cites work: The eigenvalues of random symmetric matrices
cites work: Max Cut for Random Graphs with a Planted Partition
cites work: Spectral techniques applied to sparse random graphs
cites work: Heuristics for semirandom graph problems
cites work: The solution of some random NP-hard problems in polynomial expected time
cites work: Q4705344
cites work: A Spectral Technique for Coloring Random 3-Colorable Graphs
full work available at URL: s0963548309990514
OpenAlex ID: W2133361319
description: scientific article