{"id":"https://openalex.org/W2090103608","doi":"https://doi.org/10.5555/338219.338650","title":"On external memory graph traversal","display_name":"On external memory graph traversal","alternate_titles":[],"publication_year":2000,"publication_date":"2000-02-01","ids":{"openalex":"https://openalex.org/W2090103608","doi":"https://doi.org/10.5555/338219.338650","mag":"2090103608"},"language":"en","primary_location":{"id":"mag:2090103608","doi":"https://doi.org/10.5555/338219.338650","is_oa":false,"landing_page_url":"http://euler.slu.edu/~goldwasser/publications/SODA2000.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306420974","display_name":"Symposium on Discrete Algorithms","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Symposium on Discrete Algorithms","raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W2090103608"],"child_works_count":0,"type":"conference-paper","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5111424583","display_name":"Adam L. Buchsbaum","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I1283103587","display_name":"AT&T (United States)","ror":"https://ror.org/02bbd5539","country_code":"US","type":"company","lineage":["https://openalex.org/I1283103587"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Adam L. Buchsbaum","raw_affiliation_strings":["AT&T Labs, Shannon Laboratory, 180 Park Ave., Florham Park, NJ"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"AT&T Labs, Shannon Laboratory, 180 Park Ave., Florham Park, NJ","institution_ids":["https://openalex.org/I1283103587"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5079673636","display_name":"Michael H. Goldwasser","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I1925986","display_name":"Loyola University Chicago","ror":"https://ror.org/04b6x2g63","country_code":"US","type":"education","lineage":["https://openalex.org/I1925986"]},{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Michael H. Goldwasser","raw_affiliation_strings":["Dept. of Math and Comp. Science, Loyola University Chicago, 6525 N. Sheridan Rd., Chicago, IL and Princeton University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Math and Comp. Science, Loyola University Chicago, 6525 N. Sheridan Rd., Chicago, IL and Princeton University","institution_ids":["https://openalex.org/I1925986","https://openalex.org/I20089843"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5061790878","display_name":"Suresh Venkatasubramanian","orcid":"https://orcid.org/0000-0001-7679-7130","observed_orcids":["https://orcid.org/0000-0001-7679-7130"]},"institutions":[{"id":"https://openalex.org/I1283103587","display_name":"AT&T (United States)","ror":"https://ror.org/02bbd5539","country_code":"US","type":"company","lineage":["https://openalex.org/I1283103587"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Suresh Venkatasubramanian","raw_affiliation_strings":["AT&T Labs, Shannon Laboratory, 180 Park Ave., Florham Park, NJ"],"raw_orcid":"https://orcid.org/0000-0001-7679-7130","affiliations":[{"raw_affiliation_string":"AT&T Labs, Shannon Laboratory, 180 Park Ave., Florham Park, NJ","institution_ids":["https://openalex.org/I1283103587"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5034718361","display_name":"Jeffery Westbrook","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I1283103587","display_name":"AT&T (United States)","ror":"https://ror.org/02bbd5539","country_code":"US","type":"company","lineage":["https://openalex.org/I1283103587"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jeffery Westbrook","raw_affiliation_strings":["AT&T Labs, Shannon Laboratory, 180 Park Ave., Florham Park, NJ"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"AT&T Labs, Shannon Laboratory, 180 Park Ave., Florham Park, NJ","institution_ids":["https://openalex.org/I1283103587"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.0615,"has_fulltext":false,"cited_by_count":140,"citation_normalized_percentile":{"value":0.9543379,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"859","last_page":"860"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.7157999873161316,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.7157999873161316,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.2029000073671341,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.046799998730421066,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/external-memory-algorithms","display_name":"external memory algorithms","score":0.902999997138977},{"id":"https://openalex.org/keywords/graph-traversal","display_name":"graph traversal","score":0.9079999923706055},{"id":"https://openalex.org/keywords/i-o-complexity","display_name":"I/O complexity","score":0.7919999957084656},{"id":"https://openalex.org/keywords/external-memory-data-structures","display_name":"external memory data structures","score":0.7570000290870667}],"concepts":[{"id":"https://openalex.org/C96333769","wikidata":"https://www.wikidata.org/wiki/Q907955","display_name":"Graph traversal","level":3,"score":0.8237555027008057},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.7845178842544556},{"id":"https://openalex.org/C138843760","wikidata":"https://www.wikidata.org/wiki/Q325904","display_name":"Breadth-first search","level":2,"score":0.7308355569839478},{"id":"https://openalex.org/C62692426","wikidata":"https://www.wikidata.org/wiki/Q816319","display_name":"Depth-first search","level":3,"score":0.6778037548065186},{"id":"https://openalex.org/C82687282","wikidata":"https://www.wikidata.org/wiki/Q66221","display_name":"Auxiliary memory","level":2,"score":0.6568659543991089},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6371710300445557},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.6267446279525757},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.5107452869415283},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.5103399157524109},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.4934777021408081},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.47347939014434814},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.4625055193901062},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4622732102870941},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.43872225284576416},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4201810956001282},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.31180310249328613},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.30294400453567505},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.23613619804382324},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.19776198267936707},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C9390403","wikidata":"https://www.wikidata.org/wiki/Q3966","display_name":"Computer hardware","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"mag:2090103608","doi":"https://doi.org/10.5555/338219.338650","is_oa":false,"landing_page_url":"http://euler.slu.edu/~goldwasser/publications/SODA2000.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306420974","display_name":"Symposium on Discrete Algorithms","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Symposium on Discrete Algorithms","raw_type":null},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.27.9904","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.27.9904","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.research.att.com/~suresh/Papers/soda00-bfs.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.31.128","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.31.128","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.research.att.com/~alb/biblio/bfs-soda00.ps.Z","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.94.5647","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.94.5647","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://euler.slu.edu/~goldwasser/publications/SODA2000.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W1986843945","https://openalex.org/W2038142281","https://openalex.org/W2057839002","https://openalex.org/W2141883265","https://openalex.org/W2227630426","https://openalex.org/W2752885492"],"related_works":["https://openalex.org/W7095737250","https://openalex.org/W1579322109","https://openalex.org/W7098476121","https://openalex.org/W2013480322","https://openalex.org/W2602372665","https://openalex.org/W7098493208","https://openalex.org/W7097822227","https://openalex.org/W2345698770","https://openalex.org/W86567484","https://openalex.org/W2574119765"],"abstract_inverted_index":{"We":[0,37,65],"describe":[1],"a":[2,140],"new":[3],"external":[4,20,31,46],"memory":[5,21,87],"data":[6],"structure,":[7],"the":[8,17,40,55,67,81,86,91,111,124,148],"buffered":[9],"repository":[10],"tree,":[11],"and":[12,28,49,94,120,136,145,160],"use":[13,51,66],"it":[14],"to":[15,53,116,129],"provide":[16],"first":[18,56],"non-trivial":[19],"algorithm":[22,32,59],"for":[23,33,60],"directed":[24,34],"breadth-first":[25],"search":[26],"(BFS)":[27],"an":[29,78,164],"improved":[30],"depth-first":[35],"search.":[36],"also":[38],"demonstrate":[39],"equivalence":[41],"of":[42,45,113,126],"various":[43],"formulations":[44],"undirected":[47,61,157],"BFS,":[48],"we":[50,95],"these":[52],"give":[54,163],"I/O-optimal":[57],"BFS":[58],"trees.":[62],"1":[63],"Introduction":[64],"standard":[68],"I/O":[69,171],"model":[70,149],"[1],":[71],"which":[72],"counts":[73],"disk":[74,135],"accesses":[75],"incurred":[76],"by":[77],"algorithm,":[79],"using":[80],"following":[82],"parameters:":[83],"M":[84,152],"is":[85,90],"size,":[88,93],"B":[89,98,105,109],"block":[92],"assume":[96],"that":[97],"M=2.":[99],"Define":[100],"sort(N)":[101],"=":[102,122],"(":[103],"N":[104,108,118,131],"log":[106],"M=B":[107],"),":[110],"number":[112,125],"I/Os":[114,127],"needed":[115,128],"sort":[117],"items,":[119],"scan(N)":[121],"dN=Be,":[123],"transfer":[130],"contiguous":[132],"items":[133],"between":[134],"internal":[137],"memory.":[138],"Given":[139],"graph":[141],"with":[142],"V":[143,154,168],"vertices":[144],"E":[146,167],"edges,":[147],"applies":[150],"when":[151],"<":[153],"E.":[155],"For":[156],"graphs,":[158],"Kameshwar":[159],"Ranade":[161],"[5]":[162],"O(V":[165],"+":[166],"sort(V":[169],"))":[170],"algo...":[172]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2090103608","counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":4}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2016-06-24T00:00:00"}
