Efficient Algorithms for Finding Maximum Matchings in Convex Bipartite Graphs and Related Problems
Lipski W., Jr.; Preparata, F.P.
Permalink
https://hdl.handle.net/2142/74215
Description
Title Efficient Algorithms for Finding Maximum Matchings in Convex Bipartite Graphs and Related Problems Author(s) Lipski W., Jr. Preparata, F.P. Issue Date 1978-12 Keyword(s) Maximum matching Convex bipartite graph Maximum independent set Greedy algorithms Gale-optimal matching Scheduling algorithms Publisher Applied Computation Theory Group, Coordinated Science Laboratory, University of Illinois at Urbana-Champaign Series/Report Name or Number Coordinated Science Laboratory Report no. UILU-ENG 78-2227, R-834, ACT-14 Type of Resource text Language English Permalink http://hdl.handle.net/2142/74215 Sponsor(s)/Grant Number(s) Joint Services Electronics Program / DAAB-07-72-C-0259 and DAAG-20-78-C-0016 National Science Foundation / MCS76-17321
Owning Collections
