{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,24]],"date-time":"2026-07-24T13:04:42Z","timestamp":1784898282776,"version":"3.55.0"},"reference-count":29,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62402135"],"award-info":[{"award-number":["62402135"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U21A20513"],"award-info":[{"award-number":["U21A20513"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62202277"],"award-info":[{"award-number":["62202277"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100010029","name":"Taishan Scholar Foundation of Shandong Province","doi-asserted-by":"publisher","award":["tsqn202211091"],"award-info":[{"award-number":["tsqn202211091"]}],"id":[{"id":"10.13039\/501100010029","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007129","name":"Shandong Province Natural Science Foundation","doi-asserted-by":"publisher","award":["ZR2023QF059"],"award-info":[{"award-number":["ZR2023QF059"]}],"id":[{"id":"10.13039\/501100007129","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Expert Systems with Applications"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1016\/j.eswa.2026.131839","type":"journal-article","created":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T08:07:10Z","timestamp":1772525230000},"page":"131839","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Efficient semi-external breadth-first search"],"prefix":"10.1016","volume":"317","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4502-085X","authenticated-orcid":false,"given":"Xiaolong","family":"Wan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5477-9249","authenticated-orcid":false,"given":"Xixian","family":"Han","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.eswa.2026.131839_bib0001","series-title":"Proceedings of the 2017 usenix annual technical conference, usenix atc 2017","first-page":"125","article-title":"Squeezing out all the value of loaded data: An out-of-core graph processing system with reduced disk i\/o","author":"Ai","year":"2017"},{"key":"10.1016\/j.eswa.2026.131839_bib0002","series-title":"Algorithm theory - swat 2004, 9th scandinavian workshop on algorithm theory","first-page":"493","article-title":"Simplified external memory algorithms for planar dags","author":"Arge","year":"2004"},{"key":"10.1016\/j.eswa.2026.131839_bib0003","series-title":"Introduction to probability","author":"Blitzstein","year":"2014"},{"key":"10.1016\/j.eswa.2026.131839_bib0004","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1145\/1480506.1480511","article-title":"A large time-aware graph","volume":"42","author":"Boldi","year":"2008","journal-title":"SIGIR Forum"},{"key":"10.1016\/j.eswa.2026.131839_bib0005","series-title":"Computer systems: A programmer\u2019s perspective","author":"Bryant","year":"2010"},{"key":"10.1016\/j.eswa.2026.131839_bib0006","series-title":"Proceedings of the eleventh annual acm-siam symposium on discrete algorithms, January 9-11, 2000","first-page":"859","article-title":"On external memory graph traversal","author":"Buchsbaum","year":"2000"},{"key":"10.1016\/j.eswa.2026.131839_bib0007","author":"Cormen","year":"2009"},{"key":"10.1016\/j.eswa.2026.131839_bib0008","doi-asserted-by":"crossref","first-page":"131:1","DOI":"10.1145\/3369782","article-title":"Random graph modeling: A survey of the concepts","volume":"52","author":"Drobyshevskiy","year":"2020","journal-title":"ACM Computing Surveys"},{"key":"10.1016\/j.eswa.2026.131839_bib0009","series-title":"Proceedings of the 38th ACM international conference on supercomputing, ics 2024, Kyoto, Japan, June 4-7, 2024","first-page":"1","article-title":"Dawn: Matrix operation-optimized algorithm for shortest paths problem on unweighted graphs","author":"Feng","year":"2024"},{"key":"10.1016\/j.eswa.2026.131839_bib0010","series-title":"Proceedings of the ACM sigmod international conference on management of data, sigmod 2010, Indianapolis, Indiana, USA, June 6-10, 2010","first-page":"123","article-title":"Computing label-constraint reachability in graph databases","author":"Jin","year":"2010"},{"key":"10.1016\/j.eswa.2026.131839_bib0011","series-title":"8th biennial conf. on innovative data systems research","article-title":"A database system with amnesia","author":"Kersten","year":"2017"},{"key":"10.1016\/j.eswa.2026.131839_bib0012","series-title":"Proceedings of the eighth IEEE symposium on parallel and distributed processing, SPDP 1996, New Orleans, Louisiana, USA","first-page":"169","article-title":"Improved algorithms and data structures for solving graph problems in external memory","author":"Kumar","year":"1996"},{"key":"10.1016\/j.eswa.2026.131839_bib0013","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2024.125115","article-title":"Querying large-scale knowledge graphs using qualitative spatial reasoning","volume":"258","author":"Mantle","year":"2024","journal-title":"Expert Systems with Applications"},{"key":"10.1016\/j.eswa.2026.131839_bib0014","series-title":"Algorithms - ESA 2002, 10th annual European symposium","first-page":"723","article-title":"External-memory breadth-first search with sublinear i\/o","author":"Mehlhorn","year":"2002"},{"key":"10.1016\/j.eswa.2026.131839_bib0015","series-title":"Proceedings of the twelfth annual symposium on discrete algorithms, January 7\u20139, 2001, Washington, DC, USA","first-page":"87","article-title":"External memory bfs on undirected graphs with bounded degree","author":"Meyer","year":"2001"},{"key":"10.1016\/j.eswa.2026.131839_bib0016","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2023.121477","article-title":"Solving the incremental graph drawing problem by multiple neighborhood solution-based tabu search algorithm","volume":"237","author":"Peng","year":"2024","journal-title":"Expert Systems with Applications"},{"key":"10.1016\/j.eswa.2026.131839_bib0017","unstructured":"Sedgewick, R., & Wayne, K. (2016). Algorithms (Fourth edition deluxe). Addison-Wesley."},{"key":"10.1016\/j.eswa.2026.131839_bib0018","series-title":"Proceedings of the fourteenth annual ACM symposium on parallel algorithms and architectures, SPAA 2002","first-page":"282","article-title":"Heuristics for semi-external depth first search on directed graphs","author":"Sibeyn","year":"2002"},{"key":"10.1016\/j.eswa.2026.131839_bib0019","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2021.114962","article-title":"Extended high dimensional indexing approach for reachability queries on very large graphs","volume":"181","author":"Silva","year":"2021","journal-title":"Expert Systems with Applications"},{"key":"10.1016\/j.eswa.2026.131839_bib0020","series-title":"Proceedings of the 2019 usenix annual technical conference, usenix atc 2019, July 10\u201312, 2019","first-page":"429","article-title":"LUMOS: Dependency-driven disk-based graph processing","author":"Vora","year":"2019"},{"key":"10.1016\/j.eswa.2026.131839_bib0021","doi-asserted-by":"crossref","first-page":"3794","DOI":"10.1109\/TKDE.2021.3138994","article-title":"Efficient semi-external SCC computation","volume":"35","author":"Wan","year":"2023","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"10.1016\/j.eswa.2026.131839_bib0022","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1016\/j.ins.2019.07.087","article-title":"LKAQ: Large-scale knowledge graph approximate query algorithm","volume":"505","author":"Wan","year":"2019","journal-title":"Information Sciences"},{"key":"10.1016\/j.eswa.2026.131839_bib0023","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2024.123311","article-title":"Boosting existing shortest path algorithms through highly efficient building of node cut set-based overlay","volume":"247","author":"Wei","year":"2024","journal-title":"Expert Systems with Applications"},{"key":"10.1016\/j.eswa.2026.131839_bib0024","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2025.128380","article-title":"Efficient top-K S-biplexes search over large bipartite graphs with time complexity guarantees","volume":"291","author":"Xu","year":"2025","journal-title":"Expert Systems with Applications"},{"key":"10.1016\/j.eswa.2026.131839_bib0025","series-title":"20th USENIX conference on file and storage technologies, fast 2022, Santa Clara, CA, USA, February 22\u201324, 2022","article-title":"Practicably boosting the processing performance of BFS-like algorithms on semi-external graph system via I\/O-efficient graph ordering","volume":"vol. 2022","author":"Yang","year":"2022"},{"key":"10.1016\/j.eswa.2026.131839_bib0026","series-title":"Proceedings of the twenty-third international conference on architectural support for programming languages and operating systems, asplos 2018","first-page":"608","article-title":"WonderLand: A novel abstraction-based out-of-core graph processing system","author":"Zhang","year":"2018"},{"key":"10.1016\/j.eswa.2026.131839_bib0027","series-title":"Proceedings of the ACM sigmod international conference on management of data, SIGMOD 2013","first-page":"181","article-title":"I\/O efficient: Computing SCCS in massive graphs","author":"Zhang","year":"2013"},{"key":"10.1016\/j.eswa.2026.131839_bib0028","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/s00778-014-0372-z","article-title":"I\/O efficient: Computing SCCS in massive graphs","volume":"24","author":"Zhang","year":"2015","journal-title":"The VLDB Journal"},{"key":"10.1016\/j.eswa.2026.131839_bib0029","series-title":"Proceedings of the 2015 usenix annual technical conference, usenix atc 2015, July 8-10","first-page":"375","article-title":"GridGraph: Large-scale graph processing on a single machine using 2-level hierarchical partitioning","author":"Zhu","year":"2015"}],"container-title":["Expert Systems with Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0957417426007529?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0957417426007529?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,24]],"date-time":"2026-07-24T12:36:45Z","timestamp":1784896605000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0957417426007529"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6]]},"references-count":29,"alternative-id":["S0957417426007529"],"URL":"https:\/\/doi.org\/10.1016\/j.eswa.2026.131839","relation":{},"ISSN":["0957-4174"],"issn-type":[{"value":"0957-4174","type":"print"}],"subject":[],"published":{"date-parts":[[2026,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Efficient semi-external breadth-first search","name":"articletitle","label":"Article Title"},{"value":"Expert Systems with Applications","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.eswa.2026.131839","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"131839"}}