Efficient Algorithms for a Family of Matroid Intersection Problems

[1]  Robert E. Tarjan,et al.  A linear-time algorithm for a special case of disjoint set union , 1983, J. Comput. Syst. Sci..

[2]  Dan Gusfield,et al.  Matroid optimization with the interleaving of two ordered sets , 1984, Discret. Appl. Math..

[3]  Robert E. Tarjan,et al.  Data structures and network algorithms , 1983, CBMS-NSF regional conference series in applied mathematics.

[4]  Robert E. Tarjan,et al.  A data structure for dynamic trees , 1981, STOC '81.

[5]  Francesco Maffioli,et al.  A note on finding optimum branchings , 1979, Networks.

[6]  Robert E. Tarjan,et al.  Efficient algorithms for simple matroid intersection problems , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[7]  Christos H. Papadimitriou,et al.  The complexity of the capacitated tree problem , 1978, Networks.

[8]  Harold N. Gabow.  A good algorithm for smallest spanning trees with a degree constraint , 1978, Networks.

[9]  Donald B. Johnson,et al.  Selecting the Kth element in X + Y and X_1 + X_2 + ... + X_m , 1978, SIAM J. Comput..

[10]  Ellis Horowitz,et al.  Fundamentals of Computer Algorithms , 1978 .

[11]  Robert E. Tarjan,et al.  Finding optimum branchings , 1977, Networks.

[12]  Robert E. Tarjan,et al.  Finding Minimum Spanning Trees , 1976, SIAM J. Comput..

[13]  Arnold Schönhage,et al.  Finding the Median , 1976, J. Comput. Syst. Sci..

[14]  Harold N. Gabow,et al.  An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs , 1976, JACM.

[15]  Tomás Lang,et al.  Scheduling of Unit-Length Independent Tasks with Execution Constraints , 1976, Information Processing Letters.

[16]  Eugene L. Lawler,et al.  Matroid intersection algorithms , 1975, Math. Program..

[17]  Andrew Chi-Chih Yao,et al.  An O(|E| log log |V|) Algorithm for Finding Minimum Spanning Trees , 1975, Inf. Process. Lett..

[18]  A. Pan,et al.  On Finding and Updating Spanning Trees and Shortest Paths , 1975, SIAM J. Comput..

[19]  F. Glover,et al.  Finding Minimum Spanning Trees with a Fixed Number of Links at a Node , 1975 .

[20]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[21]  Manuel Blum,et al.  Time Bounds for Selection , 1973, J. Comput. Syst. Sci..

[22]  Thomas H. Brylawski.  Some properties of basic families of subsets , 1973, Discret. Math..

[23]  Nathan Friedman,et al.  Some Results on the Effect of Arithmetics on Comparison Problems , 1972, SWAT.

[24]  Richard M. Karp,et al.  A simple derivation of Edmonds' algorithm for optimum branchings , 1971, Networks.

[25]  F. Glover.  Maximum matching in a convex bipartite graph , 1967 .

[26]  J. R. Jackson.  SCHEDULING A PRODUCTION LINE TO MINIMIZE MAXIMUM TARDINESS , 1955 .