<p>There is a symmetric sparse matrix with large front. This matrix is created from graph. Element with position $(i,j)$ is not zero if nodes $i$ and $j$ are connected. 
What algorithms can be used for re-enumerating graph nodes to create matrix with lesser front?
I have only one option - <a href="http://en.wikipedia.org/wiki/Cuthill%E2%80%93McKee_algorithm" rel="nofollow">the Cuthill-McKee algorithm</a>. Is there anything else?</p>

<p>Thanks in advance.</p>

CC BY-SA 3.0
2013-09-28T16:59:40.310Z
By "front", do you mean bandwidth? I've not been able to find any definition of the front of a matrix by searching.
David Richerby
CC BY-SA 3.0
2013-09-29T19:51:07.467Z
@DavidRicherby The definition was near - on this site:
http://cstheory.stackexchange.com/questions/11271/approximating-front-size-of-asymmetric-matrices
Anyway, reducing bandwith is just fine in my case, so I will be happy to see any suggestions for this. Thanks for your attention.
Pavel Oganesyan
<ds.algorithms><graph-theory><graph-algorithms><sparse-matrix>
Sparse matrix front reducing
Pavel Oganesyan
# Sparse matrix front reducing

(Asked by: username_0 on 2013-09-28)

There is a symmetric sparse matrix with large front. This matrix is created from graph. Element with position $(i,j)$ is not zero if nodes $i$ and $j$ are connected.
What algorithms can be used for re-enumerating graph nodes to create matrix with lesser front?
I have only one option - [the Cuthill-McKee algorithm](http://en.wikipedia.org/wiki/Cuthill%E2%80%93McKee_algorithm). Is there anything else?

Thanks in advance.

**Tags:** ds.algorithms, graph-theory, graph-algorithms, sparse-matrix

> **Comments:**
> **username_1**: By "front", do you mean bandwidth? I've not been able to find any definition of the front of a matrix by searching.  
> **username_0**: @DavidRicherby The definition was near - on this site: http://cstheory.stackexchange.com/questions/11271/approximating-front-size-of-asymmetric-matrices Anyway, reducing bandwith is just fine in my case, so I will be happy to see any suggestions for this. Thanks for your attention.  

---

## 0 answers

