<p>The following article discusses various approaches to reducing the bandwidth of unsymmetric matrices.</p>

<p>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&ndash;821. </p>

<p>The technical report version of the article is available here:</p>

<p>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. <a href="http://www.numerical.rl.ac.uk/reports/rsRAL2005001.pdf" rel="noreferrer">http://www.numerical.rl.ac.uk/reports/rsRAL2005001.pdf</a></p>

CC BY-SA 3.0
2014-05-26T10:42:56.857Z
Whoops, thanks for the edit! And for the answer, that seems to be exactly what I'm looking for :)
Jonathan H
CC BY-SA 3.0
2014-06-08T11:57:29.153Z
You're welcome! I'm glad that you found the answer useful.
Hermann Gruber
CC BY-SA 3.0
2014-05-25T20:43:21.903Z
2014-11-11T23:04:30.170Z
2014-11-11T23:04:30.170Z
Hermann Gruber
<p>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.</p>

<reference-request><graph-algorithms><matrices><sparse-matrix>
Reducing the bandwidth of non-symmetric matrix
Jonathan H
# Reducing the bandwidth of non-symmetric matrix

(Asked by: username_0 on 2014-05-22)

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.

**Tags:** reference-request, graph-algorithms, matrices, sparse-matrix

---

## 1 answers

### Answer by username_1 on 2014-05-25. Score: 7 | Accepted answer

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>

> **Comments:**
> **username_0**: Whoops, thanks for the edit! And for the answer, that seems to be exactly what I'm looking for :)  
> **username_1**: You're welcome! I'm glad that you found the answer useful.  

---

