Previous |  Up |  Next


numerical analysis
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.
[1] A. L. Dulmage N. S. Mendelsohn: Two algorithms for bipartite graphs. Journal of SIAM, vol. 11, March 1963, No. 1, 183-194. MR 0154275
[2] Ф. Р. Гантмахер: Теория матриц. Москва, 1953. Zbl 1151.94459
[3] F. Нагary: A graph theoretic approach to matrix inversion by partitioning. Numerische Mathematik 4, 128-135 (1962), 2. Heft. DOI 10.1007/BF01386304 | MR 0139545
Partner of
EuDML logo