A tight upper bound on the probabilistic embedding of series-parallel graphs - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Yuval Emek, David Peleg. A tight upper bound on the probabilistic embedding of series-parallel graphs. In Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, January 22-26, 2006. pages 1045-1053, ACM Press, 2006. [doi]

This author has not been identified. Look up 'Yuval Emek' in GoogleThis author has not been identified. Look up 'David Peleg' in Google

runs on WebDSL