Files in this item

FilesDescriptionFormat

application/pdf

application/pdfB37-834.pdf (12MB)
(no description provided)PDF

Description

Title:Efficient Algorithms for Finding Maximum Matchings in Convex Bipartite Graphs and Related Problems
Author(s):Lipski W., Jr.; Preparata, F.P.
Subject(s):Maximum matching
Convex bipartite graph
Maximum independent set
Greedy algorithms
Gale-optimal matching
Scheduling algorithms
Issue Date:1978-12
Publisher:Applied Computation Theory Group, Coordinated Science Laboratory, University of Illinois at Urbana-Champaign
Series/Report:Coordinated Science Laboratory Report no. UILU-ENG 78-2227, R-834, ACT-14
Genre:Report
Type:Text
Language:English
Description:Coordinated Science Laboratory was formerly known as Control Systems Laboratory
URI:http://hdl.handle.net/2142/74215
Sponsor:Joint Services Electronics Program / DAAB-07-72-C-0259 and DAAG-20-78-C-0016
National Science Foundation / MCS76-17321
Date Available in IDEALS:2015-04-06
2017-07-14


This item appears in the following Collection(s)

Item Statistics