Revision as of 15:37, 28 September 2004 edit MathMartin (talk \| contribs) 4,455 edits m link ← Previous edit		Revision as of 02:44, 30 March 2005 edit undo Oleg Alexandrov (talk \| contribs) Extended confirmed users 47,270 edits "Spelling. This is a semi-automatic update (software suggests changes and user decides). It is likely this bot did not fix all spelling mistakes in this article." Next edit →
Line 3: ==Algorithm== Given a symmetric ''n''×''n'' matrix we visualize the matrix as the [[adjacency matrix]] of a [[graph_(mathematics)\|graph]]. The Cuthill-McKee algorithm is then a relabeling of the [[vertex_(graph theory)\|vertices]] of the graph to reduce the ~~bandwith~~bandwidth of the adjacency matrix. The algorithm produces an ordered [[n-tuple]] ''R'' of vertices which is the new order of the vertices.

Cuthill–McKee algorithm: Difference between revisions