Partitioning Sparse Matrices with Eigenvectors of Graphs
From MaRDI portal
eigenvaluesgraph partitioninggraph spectraLaplacian matrixlower boundsordering algorithmsparallel orderingpartitioning sparse matricessparse matrixvertex separators
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Direct numerical methods for linear systems and matrix inversion (65F05) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Computational methods for sparse matrices (65F50) Graph theory (including graph drawing) in computer science (68R10)
Recommendations
Cited in
(only showing first 100 items - show all)- Combinatorial and spectral aspects of nearest neighbor graphs in doubling dimensional and nearly-Euclidean spaces
- A spectral clustering-based framework for detecting community structures in complex networks
- Quotient tree partitioning of undirected graphs
- The symbiotic relationship of combinatorics and matrix theory
- Spectral partitioning with multiple eigenvectors
- Computation of incompressible flows with implicit finite element implementations on the Connection Machine
- Laplacian matrices of graphs: A survey
- Parallel physical optimization algorithms for allocating data to multicomputer nodes
- Load balancing for the parallel adaptive solution of partial differential equations
- Using domain decomposition to find graph bisectors
- Two improved algorithms for envelope and wavefront reduction
- Large-scale contact/impact simulation and sensitivity analysis on distributed-memory computers
- A parallel solver for the hp-version of finite element methods
- A retrofit based methodology for the fast generation and optimization of large-scale mesh partitions: Beyond the minimum interface size criterion
- Minimum-perimeter domain assignment
- Parallel structures and dynamic load balancing for adaptive finite element computation
- A domain-decomposition message-passing approach to transient viscous incompressible flow using explicit time integration
- On \(k\)-ary \(n\)-cubes: Theory and applications.
- Parallel adaptive solution of 3D boundary value problems by Hessian recovery
- A parallel multi-p method
- Parallel adaptive subspace correction schemes with applications to elasticity
- Dynamic load balancing in computational mechanics
- Numerical linear algebra algorithms and software
- The impact of high-performance computing in the solution of linear systems: Trends and problems
- Parallel load balancing for dynamic execution environments
- Local community detection in dynamic graphs using personalized centrality
- A novel partitioning method for block-structured adaptive meshes
- Nodal decompositions of graphs
- Variational perspective on local graph clustering
- New challenges in dynamic load balancing
- Detecting overlapping communities in networks using the maximal sub-graph and the clustering coefficient
- Detecting community structure via the maximal sub-graphs and belonging degrees in complex networks
- Partitioning graphs on message-passing machines by pairwise mincut
- Data structures and load balancing for parallel adaptive \(hp\) finite-element methods
- Web document clustering using hyperlink structures
- Graph Laplacians, nodal domains, and hyperplane arrangements
- Approximation techniques for hypergraph partitioning problems
- Reducing the effect of global communication in \(\text{GMRES} (m)\) and CG on parallel distributed memory computers
- A projection technique for partitioning the nodes of a graph
- An efficient communications strategy for finite element methods on the Connection Machine CM-5 system
- Scalability of finite element applications on distributed-memory parallel computers
- Implementation of implicit finite element methods for incompressible flows on the CM-5
- Parallel adaptive mesh refinement and redistribution on distributed memory computers
- Massively parallel finite element computations of three-dimensional, time-dependent, incompressible flows in materials processing systems
- Ductile failure analyses on massively parallel computers
- Recursive spectral algorithms for automatic domain partitioning in parallel finite element analysis
- A parallel hp-adaptive discontinuous Galerkin method for hyperbolic conservation laws
- Scalable algorithms for the solution of Navier's equations of elasticity
- Combining simulated annealing with local search heuristics
- On the validity of a front-oriented approach to partitioning large sparse graphs with a connectivity constraint
- Iterative methods for the computation of a few eigenvalues of a large symmetric matrix
- Spectral clustering with physical intuition on spring-mass dynamics
- Overlapping communities and roles in networks with node attributes: probabilistic graphical modeling, Bayesian formulation and variational inference
- Towards quantum computing based community detection
- Some two-vertex resistances of nested triangle network
- Graph coarsening: from scientific computing to machine learning
- On the resistance diameter of the Cartesian and lexicographic product of paths
- Transition from Tracy-Widom to Gaussian fluctuations of extremal eigenvalues of sparse Erdős-Rényi graphs
- Credible seed identification for large-scale structural network alignment
- Connectivity and eigenvalues of graphs with given girth or clique number
- A modularity-maximization-based approach for detecting multi-communities in social networks
- Ordering trees and graphs with few cycles by algebraic connectivity
- An efficient and accurate method to compute the Fiedler vector based on Householder deflation and inverse power iteration
- Computing semantic clusters by semantic mirroring and spectral graph partitioning
- Improved group theoretic method using graph products for the analysis of symmetric-regular structures
- Role of normalization in spectral clustering for stochastic blockmodels
- Tri-diagonal and penta-diagonal block matrices for efficient eigensolutions of problems in structural mechanics
- Geometrically nonlinear analysis of circulant structures using an efficient eigensolution method
- Complex networks: structure and dynamics
- Consistency of spectral clustering
- Spectral bisection of graphs and connectedness
- Decentralized mining social network communities with agents
- Force-based incremental algorithm for mining community structure in dynamic network
- Local and global approaches of affinity propagation clustering for large scale data
- Continuous quadratic programming formulations of optimization problems on graphs
- Spectral trisection of finite element models
- Connectedness of users-items networks and recommender systems
- PageRank beyond the web
- Advanced coarsening schemes for graph partitioning
- On some properties of the Laplacian matrix revealed by the RCM algorithm.
- Bandwidth, vertex separators, and eigenvalue optimization
- Special cluster on operations research in electrical and computer engineering: using eigenvectors to partition circuits
- Rotation gene set testing for longitudinal expression data
- State-defect constraint pairing graph coarsening method for Karush-Kuhn-Tucker matrices arising in orthogonal collocation methods for optimal control
- Eigenvalues of the adjacency and Laplacian matrices for modified regular structural models
- TRACEMIN-Fiedler: a parallel algorithm for computing the Fiedler vector
- scientific article; zbMATH DE number 991436 (Why is no real title available?)
- Domain separation by means of sign changing eigenfunctions ofp-laplacians
- scientific article; zbMATH DE number 2127748 (Why is no real title available?)
- On the maximal error of spectral approximation of graph bisection
- The Effect of Various Sparsity Structures on Parallelism and Algorithms to Reveal Those Structures
- A divisive spectral method for network community detection
- A genetic algorithm for detecting communities in large-scale complex networks
- Graph partitioning via adaptive spectral techniques
- Factorization for efficient solution of eigenproblems of adjacency and Laplacian matrices for graph products
- Identification of network modules by optimization of ratio association
- A SPECTRAL METHOD FOR AGGREGATING VARIABLES IN LINEAR DYNAMICAL SYSTEMS WITH APPLICATION TO CELLULAR AUTOMATA RENORMALIZATION
- A fast algorithm for sparse matrix computations related to inversion
- Laplacian matrices of product graphs: applications in structural mechanics
- Multi-way clustering and biclustering by the ratio cut and normalized cut in graphs
This page was built for publication: Partitioning Sparse Matrices with Eigenvectors of Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3495536)
