Author:
Datta Samir,Kulkarni Raghav
Publisher
Springer International Publishing
Reference24 articles.
1. Baker, B.S.: Approximation algorithms for NP-complete problems on planar graphs. J. ACM 41(1), 153–180 (1994)
2. Bampis, E., Giannakos, A., Karzonov, A., Manoussakis, Y., Milis, I.: Perfect matching in general vs. cubic graphs: A note on the planar and bipartite cases. Theoretical Computer Science and Applications 34(2), 87–97 (2000)
3. Blum, M., Kozen, D.: On the power of the compass (or why mazes are easier to search than graphs). In: FOCS, pp. 132–142 (1978)
4. Bourke, C., Tewari, R., Vinodchandran, N.V.: Directed planar reachability is in unambiguous log-space. TOCT 1(1) (2009)
5. Braverman, M., Kulkarni, R., Roy, S.: Space-efficient counting in graphs on surfaces. Computational Complexity 18(4), 601–649 (2009)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Frameworks for designing in-place graph algorithms;Journal of Computer and System Sciences;2022-02