Bounding Variance and Expectation of Longest Path Lengths in DAGs

Jeff Edmonds, Supratik Chakraborty. Bounding Variance and Expectation of Longest Path Lengths in DAGs. In Moses Charikar, editor, Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, Austin, Texas, USA, January 17-19, 2010. pages 766-781, SIAM, 2010. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.