An improved lower bound for competitive graph exploration

Alexander Birx, Yann Disser, Alexander V. Hopp, Christina Karousatou. An improved lower bound for competitive graph exploration. Theoretical Computer Science, 868:65-86, 2021. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.