Numerical Methods for Gremban's Expansion of Signed Graphs
DOI10.1137/16M1082433zbMath1372.05096OpenAlexW2766727362MaRDI QIDQ5372661
Alyson L. Fox, Geoffrey Sanders, Thomas A. Manteuffel
Publication date: 27 October 2017
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/16m1082433
Programming involving graphs or networks (90C35) Computational methods for sparse matrices (65F50) Theoretical approximation of solutions to ordinary differential equations (34A45) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Iterative numerical methods for linear systems (65F10) Multigrid methods; domain decomposition for initial value and initial-boundary value problems involving PDEs (65M55) Signed and weighted graphs (05C22)
Uses Software
Cites Work
- Unnamed Item
- Correlation clustering
- An efficient multigrid method for graph Laplacian systems
- Ranking hubs and authorities using matrix functions
- Toward the Optimal Preconditioned Eigensolver: Locally Optimal Block Preconditioned Conjugate Gradient Method
- Julia: A Fresh Approach to Numerical Computing
- Smoothed Aggregation Multigrid for Markov Chains
- Lean Algebraic Multigrid (LAMG): Fast Graph Laplacian Linear Solver
- Multilevel Adaptive Aggregation for Markov Chains, with Application to Web Ranking
- An Efficient Multigrid Method for Graph Laplacian Systems II: Robust Aggregation
- Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs
This page was built for publication: Numerical Methods for Gremban's Expansion of Signed Graphs
