On the inversion of sparse matrices
HTML articles powered by AMS MathViewer
- by A. L. Dulmage and N. S. Mendelsohn PDF
- Math. Comp. 16 (1962), 494-496 Request permission
References
-
A. L. Dulmage & N. S. Mendelsohn, “A structure theory of bipartite graphs of finite exterior dimension,” Trans. Roy. Soc. Canada, Sect. III 53, 1959, p. 1-13.
- Diane M. Johnson, A. L. Dulmage, and N. S. Mendelsohn, Connectivity and reducibility of graphs, Canadian J. Math. 14 (1962), 529–539. MR 140436, DOI 10.4153/CJM-1962-044-0 A. L. Dulmage & N. S. Mendelsohn, “Two algorithms for bipartite graphs,” to be published in Soc. Indust. Appl. Math.
- Frank Harary, A graph theoretic approach to matrix inversion by partitioning, Numer. Math. 4 (1962), 128–135. MR 139545, DOI 10.1007/BF01386304
- Marshall Hall Jr., An algorithm for distinct representatives, Amer. Math. Monthly 63 (1956), 716–717. MR 84476, DOI 10.2307/2309562
- L. R. Ford Jr. and D. R. Fulkerson, A simple algorithm for finding maximal network flows and an application to the Hitchcock problem, Canadian J. Math. 9 (1957), 210–218. MR 93427, DOI 10.4153/CJM-1957-024-0
Additional Information
- © Copyright 1962 American Mathematical Society
- Journal: Math. Comp. 16 (1962), 494-496
- MSC: Primary 65.35
- DOI: https://doi.org/10.1090/S0025-5718-1962-0156452-2
- MathSciNet review: 0156452