Efficient theoretic and practical algorithms for linear matroid intersection problems

Journal of Computer and System Sciences

Volumn 53, Issue 1, 1996, Pages 129-147

  Gabow, Harold N ^a   Xu, Ying ^a  

^a UCB 450   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; INTEGER PROGRAMMING; MATRIX ALGEBRA; PROBLEM SOLVING;

MATROID INTERSECTION PROBLEM;

ALGORITHMS;

EID: 0030217630     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1996.0054     Document Type: Article

References (24)

1. M. AIGNER, "Combinatorial Theory," Springer-Verlag, New York, 1979.
2. V. CHVÁTAL, "Linear Programming," Freeman, New York, 1983.
3. W. H. CUNNINGHAM, Improved bounds for matroid partition and intersection algorithms, SIAM J. Comput. 15, No. 4 (1986), 948-957.
4. D. COPPERSMITH AND S. WINOGRAD, Matrix multiplication via arithmetic progressions, in "Proceedings, 19th Annual ACM Symp. on Theory of Comput., 1987," pp. 1-6.
5. G. B. DANTZIG, "Linear Programming and Extensions," Princeton Univ. Press, Princeton, NJ, 1963.
6. J. EDMONDS, Minimum partition of a matroid into independent subsets, J. Res. Nat. Bur. Stand. B 69 (1965), 67-72.
7. A. FRANK, A weighted matroid intersection algorithm, J. Algorithms 2 (1981), 328-336.
8. M. L. FREDMAN AND R. E. TARJAN, Fibonacci heaps and their uses in improved network optimization algorithms, J. Assoc. Comput. Mach. 34, No. 3 (1987), 596-615.
9. H. N. GABOW, Scaling algorithms for network problems, J. Comput. System Sci. 31, No. 2 (1985), 148-168.
10. H. N. GABOW AND M. STALLMANN, Efficient algorithms for graphic matroid intersection and parity, in "Automata, Languages and Programming: 12th Colloquium," Lecture Notes in Computer Science, Vol. 194 (W. Brauer, Ed.), pp. 210-220, Springer-Verlag, New York/Berlin, 1985.
11. H. N. GABOW AND M. STALLMANN, An augmenting path algorithm for the parity problem on linear matroids, Combinatorica 6, No. 2 (1986), 123-150.
12. H. N. GABOW AND Y. Xu, Efficient algorithms for independent assignment on graphic and other matroids, manuscript in preparation.
13. H. N. GABOW AND R. E. TARJAN, Faster scaling algorithms for network problems, SIAM J. Comput., to appear.
14. H. N. GABOW AND R. E. TARJAN, Faster scaling algorithms for general graph matching problems, unpublished manuscript.
15. A. V. GOLDBERG AND R. E. TARJAN, Solving minimum-cost flow problems by successive approximation, in "Proceedings, 19th Annual ACM Symp. on Theory of Computing, 1987," pp. 7-18.
16. M. IRI, Applications of matroid theory, in "Mathematical Programming - The State of the Art" (A. Bachem, M. Grötschel, and B. Korte, Eds.), pp. 158-201, Springer-Verlag, New York, 1983.
17. D. E. KNUTH, "Matroid Paritioning," Tech. Rept. STAN-CS-73-342, Comput. Sci. Dept., Stanford Univ., Stanford, CA, 1973.
18. E. L. LAWLER, "Combinatorial Optimization: Networks and Matroids," Holt, Rinehart, & Winston, New York, 1976.
19. K. MUROTA, "Systems Analysis by Graphs and Matroids: Structural Solvability and Controllability," Algorithmics and Combinatorics, Vol. 3, Springer-Verlag, New York, 1987.
20. K. MUROTA, Refined study on structural controllability of descriptor systems by means of matroids, SIAM J. Control Optim. 25, No. 4 (1987), 967-989.
21. K. MUROTA, M. IRI, AND M. NAKAMURA, Combinatorial canonical form of layered mixed matrices and its applications to block-triangularization of systems of linear/nonlinear equations, SIAM J. Alg. Discrete Methods 8, No. 1 (1987), 123-149.
22. P. W. SHOR, V. V. VAZIRANI, AND M. YANNAKAKIS, Testing singularity of a class of matrices by linking matching and Gaussian elimination, manuscript.
23. R. E. TARJAN, "Data Structures and Network Algorithms," SIAM, Philadelphia, 1983.
24. D. J. A. WELSH, "Matroid Theory," Academic Press, New York, 1976.