A tight upper bound on the probabilistic embedding of series-parallel graphs.

Yuval Emek, David Peleg

Browse the full SODA paper archive.