blossom1(带花树).pdfVIP

JOURNAL OF RE SEARCH of the Na ti onal Bureau of Standards-B. Mathematics and Mathematical Phy sics Vol. 69B, Nos . 1 and 2, January-June 1965 Maximum Matching and a Polyhedron With O,1-Vertices1 Jack Edmonds (Dece mbe r I , 1964) A matc hing in a graph C is a sub set of e dges in C su c h that n o tw o meet th e sa me nod e in C . The co nv ex polyh edron C is charac te ri zed, wh ere th e extreme p oint s of C co rrespond to th e mat chin gs in C. Wh ere each e dge of C carri es a real num eri cal we ight , a n e ffi c ient algorithm is describ ed for findin g a mat chin g in C with max imum we ight·sum . Section 1 inequalities. In particular, we prov e a th eor e m analogous to one of G. Birkhoff [1] and 1. von Ne uman An algorithm is d escrib e d for optimally pamng a [5] which says that th e ex tr em e points of th e co nv ex finit e set of objects. That is, given a r eal num erical se t of doubly s to c ha sti c matri ces (ord er n by n) are weight for each unord ered pair of objects in a set th e p ermutation matric es (ord er n by n). That Y, to selec t a family of mutually di sjoint pair s th e sum th eor em and the Hungarian m ethod are based on of whos e wei ght s is maximum . Th e well-kn own