Applications of the Dulmage-Mendelsohn decomposition and network flow to graph bisection improvement

SIAM Journal on Matrix Analysis and Applications

Volumn 19, Issue 2, 1998, Pages 325-354

  Ashcraft, Cleve ^a   Liu, Joseph W H ^b  

^a BOEING COMPANY   (United States)

^b YORK UNIVERSITY   (Canada)

Author keywords

Dulmage Mendelsohn decomposition; Graph bisection; Multisection; Nested dissection; Network flow; Ordering algorithms

Indexed keywords

EID: 0032387353     PISSN: 08954798     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895479896308433     Document Type: Article

References (29)

1. C. ASHCRAFT, Compressed graphs and the minimum degree algorithm. SIAM J. Sci. Comput., 16 (1995), pp. 1404-1411.
2. C. ASHCRAFT AND J. LIU, Using domain decomposition to find graph bisectors, BIT, 37 (1997), pp. 506-534.
3. C. ASHCRAFT AND J. LIU, Robust ordering of sparse matrices using multisection, SIAM J. Matrix Anal. Appl., to appear.
4. C. ASHCRAFT AND J. LIU, Generalized nested dissection: some recent progress, in Proc. Fifth SIAM Conference on Applied Linear Algebra, SIAM, Philadelphia, PA, 1994, pp. 130-134.
5. T. BUI AND C. JONES, A heuristic for reducing fill-in in sparse matrix factorization, in Proc. Sixth SIAM Conference on Parallel Processing, SIAM, Philadelphia, PA, 1993, pp. 445-452.
6. A. C. DAMHAUG, Sparse Solution of Finite Element Equations, Ph.D. thesis, The Norwegian Institute of Technology, 1992.
7. I. DUFF, R. GRIMES, AND J. LEWIS, Sparse matrix test problems, ACM Trans. Math Software, 15 (1989), pp. 1-14.
8. A. DULMAGE AND N. MENDELSOHN, Coverings of bipartite graphs, Canad. J. Math, 10 (1958), pp. 517-534.
9. J. EDMONDS AND R. M. KARP, Theoretical improvements in algorithmic efficiency for network flow problem, J. ACM, 19 (1972), pp. 248-264.
10. S. C. EISENSTAT, private communication, Yale University, New Haven, CT, 1996.
11. L. R. FORD AND D. R. FULKERSON, Flows in Networks, Princeton University Press, Princeton, NJ, 1962.
12. D. R. FULKERSON, Flow networks and combinatorial operations research, Amer. Math. Monthly, 73 (1966), pp. 115-136.
13. A. GUPTA, WGPP: Watson Graph Partitioning and Sparse Matrix Ordering Package: Users Manual, Tech. report RC 20453 (90427), IBM T. J. Watson Research Center, Yorktown Heights, NY, 1996.
14. P. HALL, On representatives of subsets, J. London Math. Soc., 10 (1935), pp. 26-30.
15. B. HENDRICKSON AND R. LELAND, The Chaco User's Guide, Tech. report SAND93-2339, Sandia National Laboratories, Albuquerque, NM, 1993.
16. B. HENDRICKSON AND R. LELAND, An improved spectral graph partitioning algorithm for mapping parallel computations, SIAM J. Sci. Comput., 16 (1995), pp. 452-469.
17. B. HENDRICKSON AND E. ROTHBERG, Improving the runtime and quality of nested dissection ordering, SIAM J. Sci. Comput., to appear.
18. A. ITAI AND Y. SHILOACH, Maximum flow in planar networks, SIAM J. Comput., 8 (1979), pp. 135-150.
19. G. KARYPIS AND V. KUMAR, A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs, Tech. report TR 95-035, Department of Computer Science, University of Minnesota, Minneapolis, MN, 1995.
20. G. KARYPIS AND V. KUMAR, Metis: Unstructured Graph Partitioning and Sparse Matrix Ordering System, Tech. report TR 97-061, Department of Computer Science, University of Minnesota, Minneapolis, MN, 1995.
21. B. W. KERNIGHAN AND S. LIN, An efficient heuristic procedure for partitioning graphs, Bell System Tech. J., 49 (1970), pp. 291-307.
22. E. L. LAWLER, Combinatorial Optimization: Networks and Matriods, Holt, Rinehart and Winston, New York, 1967.
23. C. E. LEISERSON AND J. G. LEWIS, Ordering for parallel sparse symmetric factorization, in Parallel Processing for Scientific Computing, SIAM, Philadelphia, PA, 1989, pp. 27-31.
24. J. W. H. LIU, A graph partitioning algorithm by node separators, ACM Trans. Math Software, 15 (1989), pp. 198-219.
25. A. POTHEN, Sparse Null Bases and Marriage Theorems. Ph.D. thesis, Cornell University, Ithaca, NY, 1984.
26. A. POTHEN AND C. FAN, Computing the block triangular form of a sparse, matrix, ACM Trans. Math Software, 16 (1990), pp. 303-324.
27. A. POTHEN, H. SIMON, AND K. LIOU, Partitioning sparse matrices with eigenvectors of graphs, SIAM J. Matrix Anal. Appl., 11 (1990), pp. 430-452.
28. R. E. TARJAN, Data Structures and Network Algorithms, SIAM, Philadelphia, PA, 1983.
29. J. D. ULLMAN, Computational Aspects of VLSI, Computer Science Press, Rockville, MD, 1984.