Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications
Reference27 articles.
1. Arora S, Barak B (2009) Computational complexity: a modern approach. Cambridge University Press, Cambridge
2. Asano T, Buchin K, Buchin M, Korman M, Mulzer W, Rote G, Schulz A (2014) Reprint of: memory-constrained algorithms for simple polygons. Comput Geom 47(3):469–479
3. Asano T, Izumi T, Kiyomi M, Konagaya M, Ono H, Otachi Y, Schweitzer P, Tarui J, Uehara R (2014) Depth-first search using
$$\text{O}(n)$$
O
(
n
)
bits. In: 25th ISAAC, pp. 553–564
4. Banerjee N, Chakraborty S, Raman V (2016) Improved space efficient algorithms for BFS, DFS and applications. In: 22nd COCOON (LNCS), vol 9797. Springer, pp 119–130
5. Banerjee N, Chakraborty S, Raman V, Roy S, Saurabh S (2015) Time-space tradeoffs for dynamic programming in trees and bounded treewidth graphs. In 21st COCOON (LNCS), vol 9198. Springer, pp 349–360
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献