Lower Bounds and Exact Algorithms for the Graph Partitioning Problem Using Multicommodity Flows
Lecture Notes in Computer Science - Germany
doi 10.1007/3-540-44676-1_33
Full Text
Open PDFAbstract
Available in full text
Date
January 1, 2001
Authors
Publisher
Springer Berlin Heidelberg