Partitioning Sparse Matrices with Eigenvectors of Graphs
From MaRDI portal
eigenvaluessparse matrixLaplacian matrixlower boundsgraph partitioninggraph spectravertex separatorsordering algorithmsparallel orderingpartitioning sparse matrices
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Graph theory (including graph drawing) in computer science (68R10)
Recommendations
Cited in
(only showing first 100 items - show all)- Massively parallel finite element computations of three-dimensional, time-dependent, incompressible flows in materials processing systems
- A novel partitioning method for block-structured adaptive meshes
- A new lower bound on the size of the smallest vertex separator of a graph
- A domain-decomposition message-passing approach to transient viscous incompressible flow using explicit time integration
- Complex systems: features, similarity and connectivity
- Local and global approaches of affinity propagation clustering for large scale data
- Credible seed identification for large-scale structural network alignment
- scientific article; zbMATH DE number 2127748 (Why is no real title available?)
- Data structures and load balancing for parallel adaptive \(hp\) finite-element methods
- The effectiveness of cyclic blockwise distribution
- A fast algorithm for sparse matrix computations related to inversion
- Experience in using SIMD and MIMD parallelism for computational fluid dynamics
- Parallel adaptive subspace correction schemes with applications to elasticity
- A spectral clustering-based framework for detecting community structures in complex networks
- Parallel adaptation of general three-dimensional hybrid meshes
- A survey of direct methods for sparse linear systems
- scientific article; zbMATH DE number 1569023 (Why is no real title available?)
- On the Laplacian Eigenvalues of Gn,p
- Low-Rank Correction Methods for Algebraic Domain Decomposition Preconditioners
- scientific article; zbMATH DE number 1174760 (Why is no real title available?)
- EAMCD: an efficient algorithm based on minimum coupling distance for community identification in complex networks
- Multiway Spectral Graph Partitioning: Cut Functions, Cheeger Inequalities, and a Simple Algorithm
- Numerical linear algebra algorithms and software
- Eigensolution of Laplacian matrices for graph partitioning and domain decomposition: approximate algebraic method
- Special cluster on operations research in electrical and computer engineering: using eigenvectors to partition circuits
- Laplacian matrices of product graphs: applications in structural mechanics
- Iterative methods for the computation of a few eigenvalues of a large symmetric matrix
- A MIMD implementation of a parallel Euler solver for unstructured grids
- Mixed-integer linear programming formulations and column generation algorithms for the minimum normalized cuts problem on networks
- A unified framework of multi-objective cost functions for partitioning unstructured finite element meshes
- Implementation of implicit finite element methods for incompressible flows on the CM-5
- A SPECTRAL METHOD FOR AGGREGATING VARIABLES IN LINEAR DYNAMICAL SYSTEMS WITH APPLICATION TO CELLULAR AUTOMATA RENORMALIZATION
- Variational perspective on local graph clustering
- A projection technique for partitioning the nodes of a graph
- Multi-way clustering and biclustering by the ratio cut and normalized cut in graphs
- Two improved algorithms for envelope and wavefront reduction
- Connectivity and eigenvalues of graphs with given girth or clique number
- Parallel load balancing for dynamic execution environments
- Drawing graphs by eigenvectors: theory and practice
- Spectral bisection of graphs and connectedness
- scientific article; zbMATH DE number 1062852 (Why is no real title available?)
- Connectedness of users-items networks and recommender systems
- Decentralized mining social network communities with agents
- Eigenvectors of random graphs: nodal domains
- PageRank beyond the web
- Extension and optimization of the FIND algorithm: Computing Green's and less-than Green's functions
- Complex networks: structure and dynamics
- Graph coarsening: from scientific computing to machine learning
- Spectral partitioning with multiple eigenvectors
- 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
- Using domain decomposition to find graph bisectors
- The Effect of Various Sparsity Structures on Parallelism and Algorithms to Reveal Those Structures
- A genetic algorithm for detecting communities in large-scale complex networks
- Density-based clustering of social networks
- The impact of high-performance computing in the solution of linear systems: Trends and problems
- Spectral clustering with physical intuition on spring-mass dynamics
- A modularity-maximization-based approach for detecting multi-communities in social networks
- Laplacian matrices of graphs: A survey
- On the Laplacian index of tadpole graphs
- Consistency of spectral clustering
- Bandwidth, vertex separators, and eigenvalue optimization
- Graph partitioning via adaptive spectral techniques
- The Fiedler vector of a Laplacian tensor for hypergraph partitioning
- Approximation techniques for hypergraph partitioning problems
- scientific article; zbMATH DE number 910879 (Why is no real title available?)
- Improved group theoretic method using graph products for the analysis of symmetric-regular structures
- Top eigenpair statistics for weighted sparse graphs
- Transition from Tracy-Widom to Gaussian fluctuations of extremal eigenvalues of sparse Erdős-Rényi graphs
- Parallel physical optimization algorithms for allocating data to multicomputer nodes
- Mesh partitioning algorithms for the parallel solution of partial differential equations
- 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
- Balanced graph partitioning based on mixed 0-1 linear programming and iteration vertex relocation algorithm
- New spectral lower bounds on the bisection width of graphs
- Parallel adaptive solution of 3D boundary value problems by Hessian recovery
- A new algorithm for domain decomposition of finite element models
- Combinatorial and spectral aspects of nearest neighbor graphs in doubling dimensional and nearly-Euclidean spaces
- On the resistance diameter of the Cartesian and lexicographic product of paths
- Multi-layer bundling as a new approach for determining multi-scale correlations within a high-dimensional dataset
- A new algorithm for finding a pseudoperipheral vertex or the endpoints of a pseudodiameter in a graph
- The symbiotic relationship of combinatorics and matrix theory
- Laplace eigenvalues of graphs---a survey
- 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
- An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification
- Nodal decompositions of graphs
- Eigenvectors of random matrices: A survey
- Ductile failure analyses on massively parallel computers
- scientific article; zbMATH DE number 907925 (Why is no real title available?)
- On \(r\)-to-\(p\) norms of random matrices with nonnegative entries: asymptotic normality and \(\ell_{\infty}\)-bounds for the maximizer
- Recursive spectral algorithms for automatic domain partitioning in parallel finite element analysis
- On the validity of a front-oriented approach to partitioning large sparse graphs with a connectivity constraint
- On some properties of the Laplacian matrix revealed by the RCM algorithm.
- Geometric Separators for Finite-Element Meshes
- Parallel adaptive mesh refinement and redistribution on distributed memory computers
- Sparse regular random graphs: spectral density and eigenvectors
- Identification of network modules by optimization of ratio association
- A multidimensional and multimembership clustering method for social networks and its application in customer relationship management
- Topology and graph products; eigenproblems in optimal structural analysis
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)
