Author:
Kovkov D. V.,Lemtyuzhnikova D. V.
Subject
Applied Mathematics,Computer Networks and Communications,Computer Vision and Pattern Recognition,Information Systems,Theoretical Computer Science,Control and Systems Engineering,Software
Reference52 articles.
1. O. A. Shcherbina, “Local elimination algorithms for sparse problems of discrete optimization,” Doctoral (Phys. Math.) Dissertation (Moscow, 2011).
2. M. Yannakakis, “Computing the minimum fill-in is NP-complete,” SIAM Algebraic Discrete Meth. 2, 77–79 (1981).
3. J. W. H. Liu, “Modification of the minimum-degree algorithm by multiple elimination,” ACM Trans. Math. Software 11, 141–153 (1985).
4. P. R. Amestoy, T. A. Davis, and I. S. Duff, “An approximate minimum degree ordering algorithm,” SIAM Matrix Anal. Appl. 17, 886–905 (1996).
5. A. George, “Nested dissection of a regular finite element mesh,” SIAM Numer. Anal. 10, 345–363 (1973).
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献