Graph-theoretic transformation of matrices to quasi-triangular form

Abstract
A practically useful algorithm is constructed for determining and ordering the quasi-components of a finite oriented graph. This problem is equivalent with that of transforming a square matrix to quasi-triangular form by permutations.

This publication has 0 references indexed in Scilit: