FAQ

Cuthill–McKee algorithm

Known as: Reverse Cuthill-McKee algorithm, Reverse Cuthill–McKee, Cuthill-McKee algorithm 
In the mathematical subfield of matrix theory, the Cuthill–McKee algorithm (CM), named for Elizabeth Cuthill and J. McKee , is an algorithm to… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1996-2016
02419962016

Related topics

Related topics

13 relations
Adjacency matrixAlgorithmBreadth-first searchCython
(More)

Related mentions per year

Related mentions per year

1936-2018
19401960198020002020
Cuthill–McKee algorithm
Algorithm
Sparse matrix
Vertex
Graph
Adjacency matrix

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
A non-speculative parallelization of reverse cuthill-McKee algorithm for sparse matrices reordering
This work presents a new parallel non-speculative implementation of the Unordered Reverse Cuthill-McKee algorithm. Reordering… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2014
2014
Parallelization of Reordering Algorithms for Bandwidth and Wavefront Reduction
Many sparse matrix computations can be speeded up if the matrix is first reordered. Reordering was originally developed for… (More)
  • figure 1
  • table I
  • table II
  • table IV
  • table III
Is this relevant?
2008
2008
A partitioning algorithm for block-diagonal matrices with overlap
We present a graph partitioning algorithm that aims at partitioning a sparse matrix into a block-diagonal form, such that any two… (More)
Is this relevant?
2006
2006
Parallel Iterative Solvers for Ill-Conditioned Problems with Reordering
1. Preconditioned Iterative Solvers with Multicoloring In the previous work [1], author developed an efficient parallel iterative… (More)
  • figure 2
  • figure 5
  • figure 6
  • table 1
  • figure 4
Is this relevant?
2006
2006
Reducing the Total Bandwidth of a Sparse Unsymmetric Matrix
For a sparse symmetric matrix, there has been much attention given to algorithms for reducing the bandwidth. As far as we can see… (More)
Is this relevant?
1998
1998
Ordering symmetric sparse matrices 1 for small profile and wavefront
The ordering of large sparse symmetric matrices for small profile and wavefront or for small bandwidth is important for the… (More)
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?
1998
1998
State Space Orderings for Gauss-Seidel in Markov Chains Revisited
States of a Markov chain may be reordered to reduce the magnitude of the subdominant eigenvalue of the Gauss–Seidel (GS… (More)
Is this relevant?
1997
1997
Progress in Newton-krylov Methods for Aerodynamic Calculations
An eecient Newton-GMRES algorithm is presented for computing steady compressible aerodynamic ows on structured grids. The… (More)
Is this relevant?
1997
1997
An Efficient Newton-gmres Solver for Aerodynamic Computations
An eecient inexact-Newton-Krylov algorithm is presented for the computation of steady aerodynamic ows. The algorithm uses… (More)
  • figure 3
  • figure 4
Is this relevant?
1996
1996
Two Improved Algorithms for Envelope Andwavefront Reduction
  • Gary Kumferty, Alex Pothenyz
  • 1996
Two algorithms for reordering sparse, symmetric matrices or undirected graphs to reduce envelope and wavefront are considered… (More)
Is this relevant?