Space efficient algorithms for breadth-depth search

DOI10.1007/978-3-030-25027-0_14MaRDI QIDQ2291421zbMATH OpenOpenAlexFDO

Authors Sankardeep Chakraborty, A. Mukherjee, Srinivasa Rao Satti

Publication date 30 January 2020

Full work available at URL https://arxiv.org/abs/1906.07874

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Fast breadth-first search in still less space
• Improved space efficient algorithms for BFS, DFS and applications
• Space efficient linear time algorithms for BFS, DFS and applications
• Depth-First Search Using O(n) Bits
• Space-efficient basic graph algorithms

Cited in

(6)

• Frameworks for designing in-place graph algorithms
• Fast breadth-first search in still less space
• Memory-Efficient Algorithms for Finding Needles in Haystacks
• scientific article; zbMATH DE number 3907783 (Why is no real title available?)
• Optimal In-place Algorithms for Basic Graph Problems
• Hierarchical Heavy Hitters with the Space Saving Algorithm

This page was built for publication: Space efficient algorithms for breadth-depth search

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2291421)