Multi-level spectral graph partitioning method

DOI10.1088/1742-5468/AA85BAzbMATH Open1456.05102OpenAlexW2757631062MaRDI QIDQ3303201FDOQ3303201

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

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

Mathematics Subject Classification ID

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

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
• Fast unfolding of communities in large networks
• Consistent adjacency-spectral partitioning for the stochastic block model when the model parameters are unknown
• Fast balanced partitioning is hard even on grids and trees
• 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
• Coupling Strength Allocation for Synchronization in Complex Networks Using Spectral Graph Theory

Cited In (2)

• Spectral partitioning with multiple eigenvectors
• Title not available (Why is that?)

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)