Revision as of 05:57, 26 November 2015 edit Nonhermitian (talk \| contribs) 61 edits m Added link to open-source RCM routine in the Python SciPy package. ← Previous edit		Revision as of 14:39, 31 January 2016 edit undo BD2412 (talk \| contribs) Autopatrolled, Administrators 2,527,143 edits m →Algorithm: Graph (mathematics) is now a disambiguation link; please fix., replaced: graph → graph{{dn\|{{subst:DATE}}}} using AWB Next edit →
Line 16: ==Algorithm== Given a symmetric <math>n\times n</math> matrix we visualize the matrix as the [[adjacency matrix]] of a [[~~graph~~Graph (mathematics)\|graph]]{{dn\|date=January 2016}}. The Cuthill–McKee algorithm is then a relabeling of the [[vertex (graph theory)\|vertices]] of the graph to reduce the bandwidth of the adjacency matrix. The algorithm produces an ordered [[n-tuple\|''n''-tuple]] ''R'' of vertices which is the new order of the vertices.

Cuthill–McKee algorithm: Difference between revisions