Space Efficient Algorithms for Breadth-Depth Search
暂无分享,去创建一个
S. Srinivasa Rao | Sankardeep Chakraborty | Anish Mukherjee | S. S. Rao | A. Mukherjee | Sankardeep Chakraborty
[1] S. Srinivasa Rao,et al. Biconnectivity, st-numbering and other applications of DFS using O(n) bits , 2016, J. Comput. Syst. Sci..
[2] Robert E. Tarjan,et al. Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs , 1984, SIAM J. Comput..
[3] Marcel Roeloffzen,et al. Improved Time-Space Trade-offs for Computing Voronoi Diagrams , 2018, J. Comput. Geom..
[4] Raymond Greenlaw,et al. Breadth-Depth Search is P-Complete , 1993, Parallel Process. Lett..
[5] Sankar Deep Chakraborty. Space efficient graph algorithms [HBNI Th 134] , 2018 .
[6] Amr Elmasry,et al. Space-efficient Basic Graph Algorithms , 2015, STACS.
[7] Yota Otachi,et al. Space-Efficient Algorithms for Longest Increasing Subsequence , 2018, STACS.
[8] Friedhelm Meyer auf der Heide,et al. De Dictionariis Dynamicis Pauco Spatio Utentibus (lat. On Dynamic Dictionaries Using Little Space) , 2006, LATIN.
[9] S. Srinivasa Rao,et al. Improved Space-efficient Linear Time Algorithms for Some Classical Graph Problems , 2017, ArXiv.
[10] Derek G. Corneil,et al. A Unified View of Graph Searching , 2008, SIAM J. Discret. Math..
[11] Ellis Horowitz,et al. Fundamentals of Computer Algorithms , 1978 .
[12] S. Srinivasa Rao,et al. Space Efficient Linear Time Algorithms for BFS, DFS and Applications , 2017, Theory of Computing Systems.
[13] S. Srinivasa Rao,et al. A Framework for In-place Graph Algorithms , 2018, ESA.
[14] Joshua R. Wang,et al. Deterministic Time-Space Tradeoffs for k-SUM , 2016, ICALP.
[15] S. Srinivasa Rao,et al. Space-efficient algorithms for maximum cardinality search, its applications, and variants of BFS , 2019, J. Comb. Optim..
[16] Yota Otachi,et al. Depth-First Search Using O(n) Bits , 2014, ISAAC.
[17] Bin Jiang,et al. I/O-and CPU-Optimal Recognition of Strongly Connected Components , 1993, Inf. Process. Lett..