Changeset 869:636dadefe1e6 in lemon-main for doc
- Timestamp:
- 09/25/09 21:51:36 (15 years ago)
- Branch:
- default
- Phase:
- public
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
doc/groups.dox
r710 r869 350 350 problem of maximum flow. 351 351 352 \ref Circulation is a preflow push-relabel algorithm implemented directly 352 \ref Circulation is a preflow push-relabel algorithm implemented directly 353 353 for finding feasible circulations, which is a somewhat different problem, 354 354 but it is strongly related to maximum flow. … … 471 471 Edmond's blossom shrinking algorithm for calculating maximum weighted 472 472 perfect matching in general graphs. 473 - \ref MaxFractionalMatching Push-relabel algorithm for calculating 474 maximum cardinality fractional matching in general graphs. 475 - \ref MaxWeightedFractionalMatching Augmenting path algorithm for calculating 476 maximum weighted fractional matching in general graphs. 477 - \ref MaxWeightedPerfectFractionalMatching 478 Augmenting path algorithm for calculating maximum weighted 479 perfect fractional matching in general graphs. 473 480 474 481 \image html bipartite_matching.png
Note: See TracChangeset
for help on using the changeset viewer.