A practical algorithm for making filled graphs minimal

Theoretical Computer Science

Volumn 250, Issue 1-2, 2001, Pages 125-141

  Blair, Jean R S ^a   Heggernes, Pinar ^b   Telle, Jan Arne ^b  

^a UNITED STATES MILITARY ACADEMY   (United States)

^b UNIVERSITY OF BERGEN   (Norway)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; HEURISTIC METHODS; MATRIX ALGEBRA; PROBLEM SOLVING;

ARBITRARY FILLED GRAPHS; SPARSE MATRICES;

COMPUTATIONAL GEOMETRY;

EID: 0034911146     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0304-3975(99)00126-7     Document Type: Article

References (22)

1. C. Beeri, R. Fagin, D. Maier, M. Yannakakis, On the desirability of acyclic database systems, J. Assoc. Comput. Mach. 30 (1983) 479-513.
2. J.R.S. Blair, P. Heggernes, J.A. Telle, Making an arbitrary filled graph minimal by removing fill edges, in: R. Karlsson, A. Lingas (Eds.), Algorithm Theory - SWAT'96, Lecture Notes in Computer Science, vol. 1097, Springer, Berlin, 1996, pp. 173-184.
3. R. Boisvert, R. Pozo, K. Remington, R. Barrett, J. Dongarra, Matrix market: a web resource for test matrix collections, in: R. Boisvert (Ed.), The Quality of Numerical Software: Assessment and Enhancement, Chapman & Hall, London, 1997, pp. 125-137.
4. R. Boisvert, R. Pozo, K. Remington, B. Miller, R. Lipman, NIST Matrix Market, http://math.nist.gov/ MatrixMarket/.
5. F.R.K. Chung, D. Mumford, Chordal completions of planar graphs, J. Combin. Theory 31 (1994) 96-106.
6. E. Dahlhaus, Minimal elimination ordering inside a given chordal graph, in: R.H. Möhring (Ed.), Graph Theoretical Concepts in Computer Science, Lecture Notes in Computer Science, vol. 1335, Springer, Berlin, 1997, pp. 132-143.
7. E. Dahlhaus, M. Karpinski, An efficient parallel algorithm for the minimal elimination ordering of an arbitrary graph, Proc. FOCS, 1989, pp. 454-459.
8. I.S. Duff, R.G. Grimes, J.G. Lewis, Sparse matrix test problems, ACM Trans. Math. Software 15 (1989) 1-14.
9. R.E. England, J.R.S. Blair, M.G. Thomason, Independent computations in a probablistic knowledge-based system, Technical Report CS-90-128, Department of Computer Science, University of Tennessee, Knoxville, Tennessee, 1991.
10. A. George, J.W.H. Liu, Computer Solution of Large Sparse Positive Definite Systems, Prentice-Hall Inc., Englewood Cliffs, NJ, 1981.
11. G. Karypis, METIS Family of multilevel partitioning algorithms, http://www-users.cs.umn.edu /~karypis/metis/.
12. S.L. Lauritzen, D.J. Spiegelhalter, Local computations with probabilities on graphical structures and their applications to expert systems, J. Royal Statist. Soc. Ser B 50 (1988) 157-224.
13. J.G. Lewis, B.W. Peyton, A. Pothen, A fast algorithm for reordering sparse matrices for parallel factorization, SIAM J. Sci. Statist. Comput. 10 (1989) 1156-1173.
14. J.W.H. Liu, Private communication.
15. J.W.H. Liu, Equivalent sparse matrix reordering by elimination tree rotations, SIAM J. Sci. Statist. Comput. 9 (1988) 424-444.
16. J.W.H. Liu, A. Mirzaian, A linear reordering algorithm for parallel pivoting of chordal graphs, SIAM J. Discrete Math. 2 (1989) 100-107.
17. T. Ohtsuki, L.K. Cheung, T. Fujisawa, Minimal triangulation of a graph and optimal pivoting ordering in a sparse matrix, J. Math. Anal. Appl. 54 (1976) 622-633.
18. B.W. Peyton, Some applications of clique trees to the solution of sparse linear systems, Ph.D. Thesis, Department of Mathematical Sciences, Clemson University, 1986.
19. D.J. Rose, A graph-theoretic study of the numerical solution of sparse positive definite systems of linear equations, in: R.C. Read (Ed.), Graph Theory and Computing, Academic Press, New York, 1972, pp. 183-217.
20. D.J. Rose, R.E. Trajan, G.S. Lueker, Algorithmic aspects of vertex elimination on graphs, SIAM J. Comput. 5 (1976) 266-283.
21. R.E. Tarjan, M. Yannakakis, Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs, SIAM J. Comput. 13 (1984) 566-579.
22. M. Yannakakis, Computing the minimum fill-in is NP-complete, SIAM J. Algebraic Discrete Methods 2 (1981) 77-79.