Spectral partitioning with multiple eigenvectors
From MaRDI portal
Recommendations
- Spectral partitioning with blends of eigenvectors
- scientific article; zbMATH DE number 2127748
- Multi-level spectral graph partitioning method
- Fundamentals of Computation Theory
- Partitioning Sparse Matrices with Eigenvectors of Graphs
- Optimal partitions for eigenvalues
- Graph partitioning by eigenvectors
- Spectral bisection with two eigenvectors
- Multiple partitions alignment via spectral rotation
Cites work
- scientific article; zbMATH DE number 49142 (Why is no real title available?)
- scientific article; zbMATH DE number 3554030 (Why is no real title available?)
- scientific article; zbMATH DE number 867649 (Why is no real title available?)
- scientific article; zbMATH DE number 910879 (Why is no real title available?)
- scientific article; zbMATH DE number 3417498 (Why is no real title available?)
- A New Heuristic for Partitioning the Nodes of a Graph
- A computational study of graph partitioning
- A projection technique for partitioning the nodes of a graph
- An r-Dimensional Quadratic Placement Algorithm
- An Algorithm for Partitioning the Nodes of a Graph
- An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
- Equivalence of Memory to “Random Logic”
- Improved approximation algorithms for MAX \(k\)-CUT and MAX BISECTION
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Laplacian eigenvalues and the maximum cut problem
- Lower Bounds for the Partitioning of Graphs
- Modeling hypergraphs by graphs with the same mincut properties
- Partitioning Sparse Matrices with Eigenvectors of Graphs
- Recent directions in netlist partitioning: a survey
- Solving the max-cut problem using eigenvalues
- The indefinite zero-one quadratic problem
- The performance of an eigenvalue bound on the max-cut problem in some classes of graphs
Cited in
(32)- Face recognition using spectral features
- Community detection based on network communicability
- Almost-invariant sets and invariant manifolds - connecting probabilistic and geometric descriptions of coherent structures in flows
- HARP: A dynamic spectral partitioner
- On the multiplicity of Laplacian eigenvalues and Fiedler partitions
- Robust FEM-based extraction of finite-time coherent sets using scattered, sparse, and incomplete trajectories
- Spectral partitioning with blends of eigenvectors
- A vector partitioning approach to detecting community structure in complex networks
- Partitions of networks that are robust to vertex permutation dynamics
- scientific article; zbMATH DE number 2127748 (Why is no real title available?)
- Community detection in networks via a spectral heuristic based on the clustering coefficient
- Special cluster on operations research in electrical and computer engineering: using eigenvectors to partition circuits
- On the structure of isometrically embeddable metric spaces
- Statistically optimal almost-invariant sets
- Worst-case ratios of networks in the rectilinear plane
- Grouping objects in multi-band images using an improved eigenvector-based algorithm
- Multi-level spectral graph partitioning method
- Online summarization of dynamic graphs using subjective interestingness for sequential data
- First-principles multiway spectral partitioning of graphs
- scientific article; zbMATH DE number 2016089 (Why is no real title available?)
- ILP-Based Local Search for Graph Partitioning
- Spectral methods for graph clustering - a survey
- scientific article; zbMATH DE number 437546 (Why is no real title available?)
- Multidimensional partitioning and bi-partitioning: analysis and application to gene expression data sets
- scientific article; zbMATH DE number 2062634 (Why is no real title available?)
- Computer Vision - ECCV 2004
- Multiway Spectral Graph Partitioning: Cut Functions, Cheeger Inequalities, and a Simple Algorithm
- Partitioning Sparse Matrices with Eigenvectors of Graphs
- Computational Science - ICCS 2004
- Improving graph partitions using submodular functions.
- Graph partitioning by eigenvectors
- scientific article; zbMATH DE number 7286677 (Why is no real title available?)
This page was built for publication: Spectral partitioning with multiple eigenvectors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1276952)
