Glover, F. Maximum matching in a convex bipartite graph. (English) Zbl 0183.24501 Nav. Res. Logist. Q. 14, 313-316 (1967). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 1 ReviewCited in 61 Documents Keywords:operations research × Cite Format Result Cite Review PDF Full Text: DOI References: [1] ”Optimum Branchings,” National Bureau of Standards, Washington, D.C. (Presented under the title ”Optimum Arborescences” at the International Seminar on Graph Theory and Its Applications, Rome, July 1966). This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.