Traversing graphs in a paging environment, BFS or DFS?

Information Processing Letters

Volume 37, Issue 3, 18 February 1991, Pages 143-147

Click to open first page preview

B. Jiang
Design, analysis and evaluation of algorithms for computing partial transitive closures in database
K. Mehlhorn
Data Structures and Algorithms 2: Graph Algorithms and NP-Completeness
(1984)

There are more references available in the full text version of this article.

A noisy label and negative sample robust loss function for DNN-based distant supervised relation extraction
Neural Networks, Volume 139, 2021, pp. 358-370
Lihui Deng, …, Shihu Wu
A survey on deep learning based knowledge tracing
Knowledge-Based Systems, Volume 258, 2022, Article 110036
Xiangyu Song, …, Chengfei Liu
Government regulations in cyber security: Framework, standards and recommendations
Future Generation Computer Systems, Volume 92, 2019, pp. 178-188
Jangirala Srinivas, …, Neeraj Kumar
Intelligent financial fraud detection: A comprehensive review
Computers & Security, Volume 57, 2016, pp. 47-66
Jarrod West, Maumita Bhattacharya
A Learning Loop Model of Collaborative Decision-Making in Chronic Illness
Academic Pediatrics, Volume 19, Issue 5, 2019, pp. 497-503
Sarah D. Ronis, …, Kurt C. Stange
Using graph embedding and machine learning to identify rebels on twitter
Journal of Informetrics, Volume 15, Issue 1, 2021, Article 101121
Muhammad Ali Masood, Rabeeh Ayaz Abbasi