Scribd
Upload
29 views16 pages

Math & Computer Chemistry Insights

This document discusses matching theory and algorithms for finding maximum matchings in graphs. It presents new algorithms for finding maximum matchings that improve upon previous algorithms in terms of running time. The algorithms use techniques such as alternating paths, blossoms, and augmenting the matching in iterations to build larger matchings until no more improvements can be made.

Uploaded by

dragance106
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
29 views16 pages

Math & Computer Chemistry Insights

This document discusses matching theory and algorithms for finding maximum matchings in graphs. It presents new algorithms for finding maximum matchings that improve upon previous algorithms in terms of running time. The algorithms use techniques such as alternating paths, blossoms, and augmenting the matching in iterations to build larger matchings until no more improvements can be made.

Uploaded by

dragance106
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 16

MATCH MATCH Commun. Math. Comput. Chem.

78 (2017) 511-526
Communications in Mathematical
and in Computer Chemistry ISSN 0340 - 6253
-512-
-513-
-514-
-515-
-516-
-517-
-518-
-519-
-520-
-521-
-522-
-523-
-524-
-525-
-526-

You might also like