Multi-level spectral graph partitioning method

DOI10.1088/1742-5468/AA85BAMaRDI QIDQ3303201zbMATH OpenOpenAlexFDO

Authors Muhammed Fatih Talu

Publication date 11 August 2020

Published in Journal of Statistical Mechanics: Theory and Experiment (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1088/1742-5468/aa85ba

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Random graphs (graph-theoretic aspects) (05C80) Analysis of algorithms (68W40)

Recommendations

• A partitioning requiring rapidity and quality: the multilevel method and partitions refinement algorithms
• Computational Science - ICCS 2004
• First-principles multiway spectral partitioning of graphs
• Spectral partitioning with multiple eigenvectors
• \(n\)-level graph partitioning

Cites work

• A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
• An Efficient Heuristic Procedure for Partitioning Graphs
• Community structure in social and biological networks
• Consistent adjacency-spectral partitioning for the stochastic block model when the model parameters are unknown
• Coupling Strength Allocation for Synchronization in Complex Networks Using Spectral Graph Theory
• Fast balanced partitioning is hard even on grids and trees
• Fast unfolding of communities in large networks
• Graph Clustering Via a Discrete Uncoupling Process
• Graph partitioning
• Graph partitioning using matrix values for preconditioning symmetric positive definite systems
• Strict Fibonacci heaps
• Tree‐based Graph Partitioning Constraint

Cited in

(2)

• Spectral partitioning with multiple eigenvectors
• scientific article; zbMATH DE number 6276186 (Why is no real title available?)

This page was built for publication: Multi-level spectral graph partitioning method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3303201)