A linear time implementation of the reverse Cuthill-McKee algorithm (Q3876923): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3277097 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3664299 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Implementation of a Pseudoperipheral Node Finder / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Algorithms for Matrix Partitioning and the Numerical Solution of Finite Element Systems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Algorithm for Reducing the Bandwidth and Profile of a Sparse Matrix / rank | |||
Normal rank | |||
Revision as of 04:17, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A linear time implementation of the reverse Cuthill-McKee algorithm |
scientific article |
Statements
A linear time implementation of the reverse Cuthill-McKee algorithm (English)
0 references
1980
0 references
reverse Cuthill-McKee algorithm
0 references
reordering a sparse matrix
0 references
small envelope
0 references
numerical experiments
0 references
0 references
