A linear time algorithm for maximum matchings in convex, bipartite graphs

Computers and Mathematics with Applications

Volumn 31, Issue 12, 1996, Pages 91-96

  Steiner, G ^a   Yeomans, J S ^b  

^a MCMASTER UNIVERSITY   (Canada)

^b YORK UNIVERSITY   (Canada)

Author keywords

Convex bipartite graphs; Maximum matchings

Indexed keywords

COMBINATORIAL MATHEMATICS; DATA STRUCTURES; GRAPH THEORY; MATHEMATICAL TRANSFORMATIONS; OPTIMIZATION; PROBLEM SOLVING;

CONVEX BIPARTITE GRAPHS; LINEAR TIME ALGORITHM; MAXIMUM MATCHING; OFF LINE MINIMUM PROBLEM;

ALGORITHMS;

EID: 0030172457     PISSN: 08981221     EISSN: None     Source Type: Journal    
DOI: 10.1016/0898-1221(96)00079-X     Document Type: Article

References (15)

1. nd edition, North-Holland Mathematical Library, Elsevier Science Publishers B.V., Amsterdam, (1985).
2. C. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Prentice Hall, Englewood Cliffs, NJ, (1982).
3. E. Lawler, Combinatorial Optimization: Networks and Matroids, Holt, Rinehart and Winston, New York, (1976).
4. P. Ramanan, J. Deogun and C. Liu, A personnel assignment problem, Journal of Algorithms 5, 132-144, (1984).
5. nd edition, Marcel Dekker, New York, (1992).
6. F. Glover, Maximum matchings in a convex bipartite graph, Naval Research Logistics Quarterly 4 (3), 313-316, (1967).
7. U. Derigs, O. Goecke and R. Schrader, Bisimplicial edges, Gaussian elimination and matchings in bipartite graphs, In Graph Theoretic Concepts in Computer Science Proceedings West Germany '84, (Edited by U. Pape), pp. 79-87, Trauner Verlag, Linz, (1984).
8. G. Steiner and S. Yeomans, Level schedules for mixed-model, just-in-time processes, Management Science 39 (6), 728-735, (1993).
9. G. Gallo, An O(n log n) algorithm for the convex bipartite matching problem, Operations Research Letters 3 (1), 31-34, (1984).
10. W. Lipski and F. Preparata, Efficient algorithms for finding maximum matchings in convex bipartite graphs and related problems, Acta Informatica 15, 329-346, (1981).
11. R. Tarjan, Data Structures and Network Algorithms, Society for Industrial and Applied Mathematics, Philadelphia, PA, (1983).
12. M. Scutella and G. Scevola, A modification of Lipski-Preparata's algorithm for the maximum matching problem on bipartite convex graphs, Ricerca Operativa 46, 63-77, (1988).
13. G. Frederickson, Scheduling unit-time tasks with integer release times and deadlines, Information Processing Letters 16, 171-173, (1983).
14. G. Steiner and S. Yeomans, A note on "Scheduling unit-time tasks with integer release times and deadlines", Information Processing Letters 43, 165-167, (September 1993).
15. A. Aho, J. Hopcroft and J. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, (1974).