Pages that link to "Item:Q4852763"
From MaRDI portal
The following pages link to A spectral algorithm for envelope reduction of sparse matrices (Q4852763):
Displaying 28 items.
- A constructive bandwidth reduction algorithm -- a variant of GPS algorithm (Q504151) (← links)
- Multiscale approach for the network compression-friendly ordering (Q553960) (← links)
- Continuation methods for approximate large scale object sequencing (Q669313) (← links)
- \texttt{PQser:} a Matlab package for spectral seriation (Q670489) (← links)
- Combinatorial optimization of special graphs for nodal ordering and graph partitioning (Q731499) (← links)
- Spectral clustering and its use in bioinformatics (Q879406) (← links)
- Laplacian graph eigenvectors (Q1307291) (← links)
- Two improved algorithms for envelope and wavefront reduction (Q1371664) (← links)
- Unravelling small world networks (Q1408397) (← links)
- A variable neighborhood search and simulated annealing hybrid for the profile minimization problem (Q1652400) (← links)
- The quadratic assignment problem is easy for Robinsonian matrices with Toeplitz structure (Q1785334) (← links)
- Leveraging special-purpose hardware for local search heuristics (Q2125062) (← links)
- An efficient and accurate method to compute the Fiedler vector based on Householder deflation and inverse power iteration (Q2252255) (← links)
- Enhanced graph-based dimensionality reduction with repulsion Laplaceans (Q2270698) (← links)
- Addressing the envelope reduction of sparse matrices using a genetic programming system (Q2352428) (← links)
- Consistency of spectral clustering (Q2426615) (← links)
- The seriation problem in the presence of a double Fiedler value (Q2679667) (← links)
- Exploitation of symmetry in graphs with applications to finite and boundary elements analysis (Q2894989) (← links)
- A GPU-based preconditioned Newton-Krylov solver for flexible multibody dynamics (Q2952737) (← links)
- TRACEMIN-Fiedler: A Parallel Algorithm for Computing the Fiedler Vector (Q3081383) (← links)
- Convex Relaxations for Permutation Problems (Q3456867) (← links)
- Perron components and algebraic connectivity for weighted graphs (Q4253151) (← links)
- A Hypergraph Partitioning Model for Profile Minimization (Q4646452) (← links)
- A GRAPH BASED DAVIDSON ALGORITHM FOR THE GRAPH PARTITIONING PROBLEM (Q5249001) (← links)
- Similarity-First Search: A New Algorithm with Application to Robinsonian Matrix Recognition (Q5351862) (← links)
- Multidimensional partitioning and bi-partitioning: analysis and application to gene expression data sets (Q5459733) (← links)
- A survey of direct methods for sparse linear systems (Q5740079) (← links)
- Localization in 1D non-parametric latent space models from pairwise affinities (Q6170608) (← links)
