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. Is there anything else?Thanks in advance.
Sparse matrix front reducing
ds.algorithms;graph theory;graph algorithms;sparse matrix