RCM++:Reverse Cuthill-McKee ordering with Bi-Criteria Node Finder
JiaJun Hou, HongJie Liu, ShengXin Zhu

TL;DR
This paper presents RCM++, a novel algorithm that improves the selection of starting nodes in the RCM algorithm, leading to better matrix reordering with minimal additional computation.
Contribution
Introduces RCM++, a new heuristic algorithm that considers eccentricity and width for optimal starting node selection in RCM, enhancing matrix reordering quality.
Findings
RCM++ outperforms existing RCM methods in software benchmarks.
RCM++ achieves higher quality reorderings with similar computational cost.
The code implementation is publicly available for further research.
Abstract
The Reverse Cuthill-McKee (RCM) algorithm is a graph-based method for reordering sparse matrices, renowned for its effectiveness in minimizing matrix bandwidth and profile. This reordering enhances the efficiency of matrix operations, making RCM pivotal among reordering algorithms. In the context of executing the RCM algorithm, it is often necessary to select a starting node from the graph representation of the matrix. This selection allows the execution of BFS (Breadth-First Search) to construct the level structure. The choice of this starting node significantly impacts the algorithm's performance, necessitating a heuristic approach to identify an optimal starting node, commonly referred to as the RCM starting node problem. Techniques such as the minimum degree method and George-Liu (GL) algorithm are popular solutions. This paper introduces a novel algorithm addressing the RCM…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgorithms and Data Compression · Natural Language Processing Techniques · Rough Sets and Fuzzy Logic
