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]
@inproceedings{EmekP06,
title = {A tight upper bound on the probabilistic embedding of series-parallel graphs},
author = {Yuval Emek and David Peleg},
year = {2006},
doi = {10.1145/1109557.1109673},
url = {http://doi.acm.org/10.1145/1109557.1109673},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/EmekP06},
cites = {0},
citedby = {0},
pages = {1045-1053},
booktitle = {Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, January 22-26, 2006},
publisher = {ACM Press},
isbn = {0-89871-605-5},
}