Nondecreasing paths in a weighted graph or: How to optimally read a train schedule

Virginia Vassilevska Williams. Nondecreasing paths in a weighted graph or: How to optimally read a train schedule. ACM Transactions on Algorithms, 6(4), 2010. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.