NIST

augmenting path

(definition)

Definition: A path with alternating free and matched edges that begins and ends with free vertices. Used to augment (improve or increase) a matching or flow.

See also alternating path.

Note: From Algorithms and Theory of Computation Handbook, page 7-3, Copyright © 1999 by CRC Press LLC. Appearing in the Dictionary of Computer Science, Engineering and Technology, Copyright © 2000 CRC Press LLC.

Author: CRC-A


Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 19 April 2004.
HTML page formatted Mon Feb 2 13:10:39 2015.

Cite this as:
Algorithms and Theory of Computation Handbook, CRC Press LLC, 1999, "augmenting path", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 19 April 2004. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/augmentngpth.html