equal
deleted
inserted
replaced
495 |
495 |
496 In practice, the \ref HowardMmc "Howard" algorithm turned out to be by far the |
496 In practice, the \ref HowardMmc "Howard" algorithm turned out to be by far the |
497 most efficient one, though the best known theoretical bound on its running |
497 most efficient one, though the best known theoretical bound on its running |
498 time is exponential. |
498 time is exponential. |
499 Both \ref KarpMmc "Karp" and \ref HartmannOrlinMmc "Hartmann-Orlin" algorithms |
499 Both \ref KarpMmc "Karp" and \ref HartmannOrlinMmc "Hartmann-Orlin" algorithms |
500 run in time O(ne) and use space O(n<sup>2</sup>+e). |
500 run in time O(nm) and use space O(n<sup>2</sup>+m). |
501 */ |
501 */ |
502 |
502 |
503 /** |
503 /** |
504 @defgroup matching Matching Algorithms |
504 @defgroup matching Matching Algorithms |
505 @ingroup algs |
505 @ingroup algs |