An Analysis of Spectral Envelope Reduction via Quadratic Assignment Problems
From MaRDI portal
Recommendations
Cited in
(14)- A survey of direct methods for sparse linear systems
- An experimental comparison of seriation methods for one-mode two-way data
- The quadratic assignment problem is easy for Robinsonian matrices with Toeplitz structure
- Unravelling small world networks
- Two improved algorithms for envelope and wavefront reduction
- Convex relaxations for permutation problems
- Leveraging special-purpose hardware for local search heuristics
- On some properties of the Laplacian matrix revealed by the RCM algorithm.
- A graph based Davidson algorithm for the graph partitioning problem
- Addressing the envelope reduction of sparse matrices using a genetic programming system
- A spectral algorithm for envelope reduction of sparse matrices
- Periodic reordering
- Continuation methods for approximate large scale object sequencing
- Spectral reordering of a range-dependent weighted random graph
This page was built for publication: An Analysis of Spectral Envelope Reduction via Quadratic Assignment Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4339126)