Cut Tree Algorithms:
An Experimental Study

Description: This page is supplementary to the paper "Cut Tree Algorithms: An Experimental Study", A.V. Goldberg, K. Tsioutsiouliklis to appear in the Journal of Algorithms (for SODA special issue).

Keywords: Maxflow, maximum flow, mincut, minimum cut, all-pairs mincut, cut-tree, Ford, Fulkerson, Gusfield, Gomory, Hu, Tarjan, Goldberg.

Subproblems identified here: All-pairs minimum cuts for general graphs.

Contact: Kostas Tsioutsiouliklis, Computer Science Dept., 35 Olden St., Princeton, NJ 08540.

CONTENTS:

• OVERVIEW - General Description of the Project and the Problem Studied
• PAPERS - Links to the Conference Paper and Technical Report
• EXPERIMENTS - Experimental Results and the Code we Used
• BIBLIOGRAPHY - Related Bibliography
• LINKS - Related Links

Last Updated: Fri Nov 19 14:58:27 EST 1999
Back to Kostas' home page.