{"id":"https://openalex.org/W2116580117","doi":"https://doi.org/10.1109/sfcs.2003.1238200","title":"I/O-efficient strong connectivity and depth-first search for directed planar graphs","display_name":"I/O-efficient strong connectivity and depth-first search for directed planar graphs","publication_year":2004,"publication_date":"2004-03-01","ids":{"openalex":"https://openalex.org/W2116580117","doi":"https://doi.org/10.1109/sfcs.2003.1238200","mag":"2116580117"},"language":"en","primary_location":{"id":"doi:10.1109/sfcs.2003.1238200","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sfcs.2003.1238200","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings.","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"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/A5084056010","display_name":"Lars Arge","orcid":null},"institutions":[{"id":"https://openalex.org/I170897317","display_name":"Duke University","ror":"https://ror.org/00py81415","country_code":"US","type":"education","lineage":["https://openalex.org/I170897317"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"L. Arge","raw_affiliation_strings":["Department of Computer Science, Duke University, Durham, NC, USA","Dept. of Comput. Sci., Duke Univ., Durham, NC, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Duke University, Durham, NC, USA","institution_ids":["https://openalex.org/I170897317"]},{"raw_affiliation_string":"Dept. of Comput. Sci., Duke Univ., Durham, NC, USA#TAB#","institution_ids":["https://openalex.org/I170897317"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5019738080","display_name":"Norbert Zeh","orcid":"https://orcid.org/0000-0002-0562-1629"},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]},{"id":"https://openalex.org/I129902397","display_name":"Dalhousie University","ror":"https://ror.org/01e6qks80","country_code":"CA","type":"education","lineage":["https://openalex.org/I129902397"]}],"countries":["CA","DK"],"is_corresponding":false,"raw_author_name":"N. Zeh","raw_affiliation_strings":["Department of Computer Science, Dalhousie University, Halifax, NS, Canada","Department of Computer Science, Faculty of Science, Aarhus University, Aarhus University"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Dalhousie University, Halifax, NS, Canada","institution_ids":["https://openalex.org/I129902397"]},{"raw_affiliation_string":"Department of Computer Science, Faculty of Science, Aarhus University, Aarhus University","institution_ids":["https://openalex.org/I204337017"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5084056010"],"corresponding_institution_ids":["https://openalex.org/I170897317"],"apc_list":null,"apc_paid":null,"fwci":1.9925,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.88999337,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"261","last_page":"270"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11181","display_name":"Advanced Data Storage Technologies","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11181","display_name":"Advanced Data Storage Technologies","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11269","display_name":"Algorithms and Data Compression","score":0.995199978351593,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.9950000047683716,"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/sort","display_name":"sort","score":0.7820440530776978},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6755025386810303},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.5880579352378845},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5311117768287659},{"id":"https://openalex.org/keywords/breadth-first-search","display_name":"Breadth-first search","score":0.5243654251098633},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.4914740324020386},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.47586721181869507},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.46119096875190735},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.4290532171726227},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4287925064563751},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4276289641857147},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.38282328844070435},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3699601888656616},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.364006906747818},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.15182185173034668}],"concepts":[{"id":"https://openalex.org/C88548561","wikidata":"https://www.wikidata.org/wiki/Q347599","display_name":"sort","level":2,"score":0.7820440530776978},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6755025386810303},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.5880579352378845},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5311117768287659},{"id":"https://openalex.org/C138843760","wikidata":"https://www.wikidata.org/wiki/Q325904","display_name":"Breadth-first search","level":2,"score":0.5243654251098633},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.4914740324020386},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.47586721181869507},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.46119096875190735},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.4290532171726227},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4287925064563751},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4276289641857147},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.38282328844070435},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3699601888656616},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.364006906747818},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.15182185173034668},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/sfcs.2003.1238200","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sfcs.2003.1238200","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings.","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.atira.dk:publications/6bc57590-bccb-11df-bd09-000ea68e967b","is_oa":false,"landing_page_url":"https://pure.au.dk/portal/en/publications/6bc57590-bccb-11df-bd09-000ea68e967b","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Arge, L A & Zeh, N 2003, I/O-efficient strong connectivity and depth-first search for directed planar graphs. in 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings.. IEEE Computer Society Press, pp. 261-270, IEEE Symposium on Foundations of Computer Science, Cambridge, MA, United States, 11/10/2003.","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.90.9684","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.90.9684","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://users.cs.dal.ca/~nzeh/Publications/dfs_focs03.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W64329647","https://openalex.org/W1480005827","https://openalex.org/W1485508724","https://openalex.org/W1982231222","https://openalex.org/W2037688351","https://openalex.org/W2038142281","https://openalex.org/W2038643780","https://openalex.org/W2046441184","https://openalex.org/W2056711744","https://openalex.org/W2057839002","https://openalex.org/W2060759452","https://openalex.org/W2088116875","https://openalex.org/W2090103608","https://openalex.org/W2103953153","https://openalex.org/W2120424341","https://openalex.org/W2140883685","https://openalex.org/W2141423686","https://openalex.org/W2141883265","https://openalex.org/W6659571990","https://openalex.org/W6665308329","https://openalex.org/W6673190471","https://openalex.org/W6681125464"],"related_works":["https://openalex.org/W2361805396","https://openalex.org/W2972254340","https://openalex.org/W1805912688","https://openalex.org/W2373973507","https://openalex.org/W2236098968","https://openalex.org/W2023670982","https://openalex.org/W2065187378","https://openalex.org/W2310663126","https://openalex.org/W2020283440","https://openalex.org/W2364510833"],"abstract_inverted_index":{"We":[0],"present":[1],"the":[2,7,16,34,53,71],"first":[3,35],"I/O-efficient":[4],"algorithms":[5,32],"for":[6,33],"following":[8],"fundamental":[9],"problems":[10,37],"on":[11],"directed":[12],"planar":[13],"graphs:":[14],"finding":[15,20],"strongly":[17],"connected":[18],"components,":[19],"a":[21,26],"simple-path":[22],"2/3-separator,":[23],"and":[24,47],"computing":[25],"depth-first":[27],"spanning":[28],"(DFS)":[29],"tree.":[30],"Our":[31],"two":[36],"perform":[38],"O(sort(N))":[39],"I/Os,":[40,67],"where":[41,68],"N":[42,60],"=":[43,49],"V":[44],"+":[45],"E":[46],"sort(N)":[48],"/spl":[50],"Theta/((N/B))":[51],"is":[52,70],"number":[54,72],"of":[55,73],"I/Os":[56],"required":[57],"to":[58],"sort":[59],"elements.":[61],"The":[62],"DFS-algorithm":[63],"performs":[64],"O(sort(N)":[65],"log(N/M))":[66],"M":[69],"elements":[74],"that":[75],"fit":[76],"into":[77],"main":[78],"memory.":[79]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}