THE EVOLUTION OF THE MINIMUM DEGREE ORDERING ALGORITHM

[31] SPEELPENNING B, 1978, UIUCDCSR78946 DEP CO

[32] DIRECT SOLUTIONS OF SPARSE NETWORK EQUATIONS BY OPTIMALLY ORDERED TRAINGULAR FACTORIZATION [J]. PROCEEDINGS OF THE INSTITUTE OF ELECTRICAL AND ELECTRONICS ENGINEERS, 1967, 55 (11): : 1801 - &

[33] COMPUTING THE MINIMUM FILL-IN IS NP-COMPLETE [J]. SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1981, 2 (01): : 77 - 79

[31] SPEELPENNING B, 1978, UIUCDCSR78946 DEP CO

[32] DIRECT SOLUTIONS OF SPARSE NETWORK EQUATIONS BY OPTIMALLY ORDERED TRAINGULAR FACTORIZATION [J]. PROCEEDINGS OF THE INSTITUTE OF ELECTRICAL AND ELECTRONICS ENGINEERS, 1967, 55 (11): : 1801 - &

[33] COMPUTING THE MINIMUM FILL-IN IS NP-COMPLETE [J]. SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1981, 2 (01): : 77 - 79