Counting and sampling minimum -cuts in weighted planar graphs in polynomial time
Under an Elsevier user license
open archive
Keywords
Counting and sampling
Minimum -cuts
Weighted planar graphs
Maximum flow
Maximal antichains in partially ordered sets
Cited by (0)
Copyright © 2011 Elsevier B.V. All rights reserved.