Efficient algorithms for a family of matroid intersection problems
- 31 March 1984
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 5 (1), 80-131
- https://doi.org/10.1016/0196-6774(84)90042-7
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- A note on finding optimum branchingsNetworks, 1979
- A good algorithm for smallest spanning trees with a degree constraintNetworks, 1978
- Selecting the Kth Element in $X + Y$ and $X_1 + X_2 + \cdots + X_m $SIAM Journal on Computing, 1978
- Design and implementation of an efficient priority queueTheory of Computing Systems, 1976
- Finding Minimum Spanning TreesSIAM Journal on Computing, 1976
- An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on GraphsJournal of the ACM, 1976
- Some properties of basic families of subsetsDiscrete Mathematics, 1973
- Time bounds for selectionJournal of Computer and System Sciences, 1973
- Optimum branchingsJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1967
- Maximum matching in a convex bipartite graphNaval Research Logistics Quarterly, 1967