Jonathan Ashley, Brian Marcus, et al.
Ergodic Theory and Dynamical Systems
We present a fast algorithm for solving m X n systems of linear equations A x = c with at most two variables per equation. The algorithm makes use of a linear-time algorithm for constructing a spanning forest of an undirected graph, and it requires 5m + 2n - 2 arithmetic operations in the worst case. © 1980.
Jonathan Ashley, Brian Marcus, et al.
Ergodic Theory and Dynamical Systems
Martin Charles Golumbic, Renu C. Laskar
Discrete Applied Mathematics
R.B. Morris, Y. Tsuji, et al.
International Journal for Numerical Methods in Engineering
F.M. Schellenberg, M. Levenson, et al.
BACUS Symposium on Photomask Technology and Management 1991