0
$\begingroup$

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.

$\endgroup$
  • 3
    $\begingroup$ By "front", do you mean bandwidth? I've not been able to find any definition of the front of a matrix by searching. $\endgroup$ – David Richerby Sep 28 '13 at 16:59
  • 1
    $\begingroup$ @DavidRicherby The definition was near - on this site: cstheory.stackexchange.com/questions/11271/… Anyway, reducing bandwith is just fine in my case, so I will be happy to see any suggestions for this. Thanks for your attention. $\endgroup$ – Pavel Oganesyan Sep 29 '13 at 19:51

Your Answer

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

Browse other questions tagged or ask your own question.