Is there an efficient algorithm to reduce the bandwidth of a directed graph's adjacency matrix? Something like the reverse Cuthill-McKee, but for non-symmetric matrices.


The following article discusses various approaches to reducing the bandwidth of unsymmetric matrices.

J.K. Reid, J. A. Scott: Reducing the total bandwidth of a sparse unsymmetric matrix, SIAM Journal on Matrix Analysis and Applications 28(3):805–821.

The technical report version of the article is available here:

J. K. Reid and J. A. Scott, Reducing the total bandwidth of a sparse unsymmetric matrix, Technical Report RAL-TR-2005-001, STFC Rutherford Appleton Laboratory. http://www.numerical.rl.ac.uk/reports/rsRAL2005001.pdf

| cite | improve this answer | |
  • 1
    $\begingroup$ Whoops, thanks for the edit! And for the answer, that seems to be exactly what I'm looking for :) $\endgroup$ – Jonathan H May 26 '14 at 10:42
  • $\begingroup$ You're welcome! I'm glad that you found the answer useful. $\endgroup$ – Hermann Gruber Jun 8 '14 at 11:57

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.