I. S. Duff
- 1 BERGE, C. The Theory of Graphs Methuen, London, 1962.Google Scholar
- 2 BUNCH, J.R., AND ROSE, D J., Eds In Proc Conf. Sparse Matrix Computations (Argonne National Laboratory, Sept 9-11, 1975), Academic Press, New York, 1976.Google Scholar
- 3 DUFF, I.S. Analysis of sparse systems. Ph.D. thesis, Oxford, England, 1972.Google Scholar
- 4 DUFF, I.S On permutations to block triangular form. J. Inst Math. Appl. 19 (1977), 339-342Google Scholar
- 5 DUFF, I S. A survey of sparse matrix research. Proc IEEE 65 (1977), 500-535.Google Scholar
- 6 DUFF, I S Algorithm 575 Permutations for a zero-free diagonal. ACM Trans. Math. Softw 7, 3 (Sept 1981), 387-390 Google Scholar
- 7 DUFF, I.S, AND REID, J K. An m~plementatlon of Tarjan's algorithm for the block triangulanzatlon of a matrix ACM Trans Math. Softw 4, 2 (June 1978), 137-147. Google Scholar
- 8 DULMAGE, A L, AND MENDELSOHN, N.S. A structure theory of b~partlte graphs of finite exterior dimension Trans Roy Soc. Can 53, Sec. 3 (1959), 1-13Google Scholar
- 9 DULMAGE, A L., AND MENDELSOHN, N.S. Two algorithms for bipartite graphs. J. SIAM 11 (1963), 183-194.Google Scholar
- 10 FORD, L.R, JR., AND FULKERSON, D.R. Flows in Networks. Princeton University Press, Princeton, N.J., 1962.Google Scholar
- 11 GUSTAVSON, F.G. Finding the block lower triangular form of a matrix. In Sparse Matrix Computations, J.R. Bunch and D J. Rose (Eds.), Academic Press, New York, 1976.Google Scholar
- 12 HALL, M. An algorithm for distinct representatives. Am. Math. Monthly 63 (1956), 716-717.Google Scholar
- 13 HALL, P. On representatives of subsets. J. London Math. Soc. 10, 37, pt. 1 (1935), 26-30Google Scholar
- 14 HARARY, F. Graph Theory. Addison-Wesley, Reading, Mass., 1969Google Scholar
- 15 HOPCROFT, J.E., AND KARP, R.M. An n5/2 algorithm for maximum matchings in bipartite graphs SIAM J. Comput. 2 (1973), 225-231.Google Scholar
- 16 SETTLER, P., AND WEIL, R. An algor,thm to provide structure for decomposition. In Proc Syrup on Sparse Matrices and their Apphcat~ons, R A. Willoughby (Ed.), IBM Rep. RA (11707), Yorktown Heights, N Y, 1969.Google Scholar
- 17 KONI6, D. Theor~e der endhchen und unendhchen Graphen Chelsea, New York, 1950.Google Scholar
- 18 KUHS, H W. The Hungarian method for solving the assignment problem. Naval Res. LogLst. Quart. 2 (1955), 83-97.Google Scholar
- 19 KUHN, H W Variants of the Hungarian method for assignment problems Naval Res Logzst Quart 3 (1957), 253-258.Google Scholar
- 20 STEWARD, D.V. On an approach to techniques for the analysis of the structure of large systems of equations. SIAM Rev. 4 (1962), 321-342Google Scholar
- 21 STEWARD, D.V Partitioning and tearing systems of equations. SIAM J Numer. Anal. 2 (1965), 345-365.Google Scholar
- 22 TARJAN, R. Depth-f'wst search and linear graph algorithms. SIAM J Comput 1 (1972), 146-160Google Scholar
- 23 WIBER6, T. Permutation of an unsymmetric matrix to block triangular form. Ph.D. dissertation, Dep of Informatzon Processing, Univ. Ume~, Ume~, Sweden, March 1977Google Scholar
- 24 WILLOUGHBY, R.A. Ed., Proc. Syrup. on Sparse Matrices and thew Applications, IBM Rep. RA 1 (11707), Yorktown Heights, N.Y., 1969.Google Scholar
Index Terms
- On Algorithms for Obtaining a Maximum Transversal
Recommendations
The colored Hadwiger transversal theorem in źd
Hadwiger's transversal theorem gives necessary and suffcient conditions for a family of convex sets in the plane to have a line transversal. A higher dimensional version was obtained by Goodman, Pollack and Wenger, and recently a colorful version ...
On Obtaining Piled OWA Operators
In this study, we propose the concept of piled ordered weighted averaging OWA operators, which generalize the centered OWA operators and also connect the step OWA operators with the Hurwicz OWA operators with given the orness degree. We propose a ...
Transversal numbers for hypergraphs arising in geometry
The (p,q) theorem of Alon and Kleitman asserts that if F is a family of convex sets in R^d satisfying the (p,q) condition for some p>=q>=d+1 (i.e. among any p sets of F, some q have a common point) then the transversal number of F is bounded by a ...
Comments