文章基本信息
- 标题：Reachability in O ( log n ) Genus Graphs is in Unambiguous
- 本地全文：下载
- 作者：Chetan Gupta ; Vimalraj Sharma ; Raghunath Tewari 等
- 期刊名称：Electronic Colloquium on Computational Complexity
- 印刷版ISSN：1433-8092
- 出版年度：2018
- 卷号：2018
- 出版社：Universität Trier, Lehrstuhl für Theoretische Computer-Forschung
- 摘要：
Given the polygonal schema embedding of an O ( logn ) genus graph G and two vertices s and t in G , we show that deciding if there is a path from s to t in G is in unambiguous logarithmic space.
