Decrementai Transitive Closure and Shortest Paths for Planar Digraphs and Beyond

Adam Karczmarz. Decrementai Transitive Closure and Shortest Paths for Planar Digraphs and Beyond. In Artur Czumaj, editor, Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, New Orleans, LA, USA, January 7-10, 2018. pages 73-92, SIAM, 2018. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.