{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T09:11:58Z","timestamp":1725700318315},"reference-count":17,"publisher":"IEEE Computer. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/sfcs.2003.1238200","type":"proceedings-article","created":{"date-parts":[[2004,3,1]],"date-time":"2004-03-01T21:26:50Z","timestamp":1078176410000},"page":"261-270","source":"Crossref","is-referenced-by-count":4,"title":["I\/O-efficient strong connectivity and depth-first search for directed planar graphs"],"prefix":"10.1109","author":[{"given":"L.","family":"Arge","sequence":"first","affiliation":[]},{"given":"N.","family":"Zeh","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"17","doi-asserted-by":"crossref","DOI":"10.22215\/etd\/2002-05092","article-title":"I\/O-Efficient algorithms for shortest path related problems","author":"zeh","year":"2002"},{"doi-asserted-by":"publisher","key":"15","DOI":"10.1137\/0220045"},{"doi-asserted-by":"publisher","key":"16","DOI":"10.1145\/384192.384193"},{"doi-asserted-by":"publisher","key":"13","DOI":"10.1137\/0136016"},{"key":"14","first-page":"372","article-title":"I\/O-optimal algorithms for planar graphs using separators","author":"maheshwari","year":"2002","journal-title":"Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms"},{"doi-asserted-by":"publisher","key":"11","DOI":"10.1137\/S0097539792227077"},{"key":"12","first-page":"169","article-title":"Improved algorithms and data structures for solving graph problems in external memory","author":"kumar","year":"1996","journal-title":"Proceedings of the 8th IEEE Symposium on Parallel and Distributed Processing"},{"key":"3","first-page":"433","article-title":"On external memory MST, SSSP, and multi-way planar separators","author":"arge","year":"2000","journal-title":"Proceedings of the 7th Scandinavian Workshop on Algorithm Theory Volume 1851 of Lecture Notes in Computer Science"},{"doi-asserted-by":"publisher","key":"2","DOI":"10.1145\/48529.48535"},{"doi-asserted-by":"publisher","key":"1","DOI":"10.1007\/s00453-003-1021-x"},{"doi-asserted-by":"publisher","key":"10","DOI":"10.1016\/S0166-218X(02)00217-2"},{"key":"7","first-page":"139","article-title":"External-memory graph algorithms","author":"chiang","year":"1995","journal-title":"Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms"},{"key":"6","first-page":"859","article-title":"On external memory graph traversal","author":"buchsbaum","year":"2000","journal-title":"Proceedings of the 11th ACM-SIAM Symposium on Discrete Algorithms"},{"key":"5","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1145\/777412.777427","article-title":"I\/O-efficient algorithms for planar digraphs","author":"arge","year":"2003","journal-title":"Proc 10th Ann ACM Symp Parallel Algorithms and Architectures"},{"doi-asserted-by":"publisher","key":"4","DOI":"10.1007\/3-540-44634-6_43"},{"doi-asserted-by":"publisher","key":"9","DOI":"10.1137\/0216064"},{"year":"1976","author":"dijkstra","journal-title":"A Discipline of Programming","key":"8"}],"event":{"acronym":"SFCS-03","name":"44th Annual IEEE Symposium on Foundations of Computer Science - FOCS 2003","location":"Cambridge, MA, USA"},"container-title":["44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8767\/27770\/01238200.pdf?arnumber=1238200","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,12]],"date-time":"2024-01-12T10:58:33Z","timestamp":1705057113000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1238200\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/sfcs.2003.1238200","relation":{},"subject":[]}}