Name
Abstract | ||
|---|---|---|
The need to find nodes with large eccentricity arises in many heuristic algorithms for ordering sparse matrix equations. A computer program is presented here for finding such nodes, based on an algorithm due to Gibbs, Poole, and Stockmeyer. Several changes have been made to their original method, and experiments suggest that these changes improve its reliability and execution time. |
Year | DOI | Venue |
|---|---|---|
1979 | 10.1145/355841.355845 | ACM Trans. Math. Softw. |
Keywords | Field | DocType |
mathematical software,sparse linear equations,pseudoperipheral node finder,graph algorithm,peripheral nodes,sparse matrix,heuristic algorithm,linear equations | Mathematical optimization,Computer science,Fringe search,Theoretical computer science,Graph bandwidth,Null-move heuristic | Journal |
Volume | Issue | Citations |
5 | 3 | 11 |
PageRank | References | Authors |
3.42 | 5 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alan George | 1 | 120 | 63.94 |
| Joseph W. H. Liu | 2 | 829 | 217.74 |