Supplemental Material
Available for Download
reducing the bandwidth and profile of sparse symmetric matrices. Gams: D2e
- 1 CRANE, H.L., GIBBS, N.E., POOLE, W.G., AND STOCKMEYER, P.K. Algorithm 508. Matrix bandwidth and profile reduction. ACM Trans. Math. Software 2, 4 (Dec. 1976), 375--377. (this issue) Google Scholar
- 2 CUTmLL, E.H., AND McKEE, j. Reducing the bandwidth of sparse symmetric matrices. Proc. 24th ACM Nat. Conf., ACM, New York, 1969, pp. 157-172. Google Scholar
- 3 GIB~S, N.E., POOLE, W.G., AND STOCKMEYER, P.K. An algorithm for reducing the bandwidth and profile of a sparse matrix. SIAM J. Numer. Analysis 18, 2 (April 1976), 235-251.Google Scholar
- 4 GXBBS, N.E., POOLE, W.G., AND STOCKMEYER, P.K. A comparison of several bandwidth and profile reduction algorithms. ACM Trans. Math. Software 2, 4 (Dec. 1976), 322-330. (this issue) Google Scholar
- 5 KING, I.P. An automatic reordering scheme for simultaneous equations derived from network analysis. Int. J. Numer. Methods Engrg. 2 (1970), 523-533.Google Scholar
Index Terms
- Algorithm 509: A Hybrid Profile Reduction Algorithm [F1]
Recommendations
The Pseudoflow Algorithm: A New Algorithm for the Maximum-Flow Problem
We introduce the pseudoflow algorithm for the maximum-flow problem that employs only pseudoflows and does not generate flows explicitly. The algorithm solves directly a problem equivalent to the minimum-cut problem---the maximum blocking-cut problem. ...
Enhancement of Redundant Reader Elimination by Using Hybrid Algorithm in RFID Systems
In this paper, we propose a hybrid algorithm, the LE algorithm, which combines Layered Optimization Approach Algorithm (LEO) and an efficient algorithm (termed "Efficient" in this paper) to achieve an optimum number of readers, based on tag ID, and a ...
Comments