Efficient algorithms for finding maximum matchings in convex bipartite graphs and related problems
- 1 August 1981
- journal article
- research article
- Published by Springer Nature in Acta Informatica
- Vol. 15 (4) , 329-346
- https://doi.org/10.1007/bf00264533
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- On an efficient method of information retrievalFundamenta Informaticae, 1979
- Testing for equality between maximum matching and minimum node coveringInformation Processing Letters, 1977
- Preserving order in a forest in less than logarithmic time and linear spaceInformation Processing Letters, 1977
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithmsJournal of Computer and System Sciences, 1976
- Information storage and retrieval — mathematical foundations II (combinatorial problems)Theoretical Computer Science, 1976
- Efficiency of a Good But Not Linear Set Union AlgorithmJournal of the ACM, 1975
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite GraphsSIAM Journal on Computing, 1973
- Optimal assignments in an ordered set: An application of matroid theoryJournal of Combinatorial Theory, 1968
- Maximum matching in a convex bipartite graphNaval Research Logistics Quarterly, 1967