{"id":"https://openalex.org/W2118382442","doi":"https://doi.org/10.1137/0201010","title":"Depth-First Search and Linear Graph Algorithms","display_name":"Depth-First Search and Linear Graph Algorithms","publication_year":1972,"publication_date":"1972-06-01","ids":{"openalex":"https://openalex.org/W2118382442","doi":"https://doi.org/10.1137/0201010","mag":"2118382442"},"language":"en","primary_location":{"id":"doi:10.1137/0201010","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0201010","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-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/A5051027549","display_name":"Robert E. Tarjan","orcid":"https://orcid.org/0000-0001-7505-5768"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Robert Tarjan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5051027549"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":86.7627,"has_fulltext":false,"cited_by_count":6000,"citation_normalized_percentile":{"value":0.99962839,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":"1","issue":"2","first_page":"146","last_page":"160"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9979000091552734,"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"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9979000091552734,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9973000288009644,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9962000250816345,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/backtracking","display_name":"Backtracking","score":0.6476234793663025},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5822873711585999},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5387585759162903},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5296221375465393},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.522692084312439},{"id":"https://openalex.org/keywords/graph-algorithms","display_name":"Graph algorithms","score":0.46141207218170166},{"id":"https://openalex.org/keywords/depth-first-search","display_name":"Depth-first search","score":0.4475270211696625},{"id":"https://openalex.org/keywords/complement-graph","display_name":"Complement graph","score":0.4469420909881592},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4107885956764221},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40735000371932983},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.3875178396701813},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.37094348669052124},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.345309853553772}],"concepts":[{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.6476234793663025},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5822873711585999},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5387585759162903},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5296221375465393},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.522692084312439},{"id":"https://openalex.org/C2986651925","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Graph algorithms","level":3,"score":0.46141207218170166},{"id":"https://openalex.org/C62692426","wikidata":"https://www.wikidata.org/wiki/Q816319","display_name":"Depth-first search","level":3,"score":0.4475270211696625},{"id":"https://openalex.org/C168291704","wikidata":"https://www.wikidata.org/wiki/Q902252","display_name":"Complement graph","level":5,"score":0.4469420909881592},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4107885956764221},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40735000371932983},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.3875178396701813},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.37094348669052124},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.345309853553772},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/0201010","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0201010","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.327.8418","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.327.8418","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.csee.wvu.edu/~xinl/library/papers/comp/Tarjan_siam1972.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.41999998688697815,"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W83921509","https://openalex.org/W1506840391","https://openalex.org/W1663053179","https://openalex.org/W2027923657","https://openalex.org/W2050911983","https://openalex.org/W2066447087","https://openalex.org/W2070992781","https://openalex.org/W2114720692","https://openalex.org/W2160645305","https://openalex.org/W2295268496","https://openalex.org/W2799004609","https://openalex.org/W4213214460"],"related_works":["https://openalex.org/W1598581090","https://openalex.org/W2058798555","https://openalex.org/W2394027715","https://openalex.org/W4253828685","https://openalex.org/W2367889194","https://openalex.org/W2917772249","https://openalex.org/W2120609036","https://openalex.org/W2122680332","https://openalex.org/W1950548798","https://openalex.org/W1585240355"],"abstract_inverted_index":{"Abstract.":[0],"The":[1,50],"value":[2],"of":[3,23,32,44,55,79,86,88],"depth-first":[4],"search":[5],"or":[6],""bacltracking":[7],""":[8],"as":[9],"a":[10,33],"technique":[11],"for":[12,26,39,67],"solving":[13],"problems":[14],"is":[15,83],"illustrated":[16],"by":[17,60],"two":[18],"examples.":[19],"An":[20],"improved":[21],"version":[22],"an":[24,45],"algorithm":[25,38],"finding":[27,40],"the":[28,41,77,84,89],"strongly":[29],"connected":[30],"components":[31,43],"directed":[34],"graph":[35,47,90],"and":[36,52,72,81],"ar":[37],"biconnected":[42],"undirect":[46],"are":[48,58],"presented.":[49],"space":[51],"time":[53],"requirements":[54],"both":[56],"algorithms":[57],"bounded":[59],"k":[61,66,73],"1V":[62],"+":[63],"k2E":[64],"d-":[65],"some":[68],"constants":[69],"kl,":[70],"k2,":[71],"a,":[74],"where":[75],"Vis":[76],"number":[78,85],"vertices":[80],"E":[82],"edges":[87],"being":[91],"examined.":[92]},"counts_by_year":[{"year":2026,"cited_by_count":70},{"year":2025,"cited_by_count":226},{"year":2024,"cited_by_count":212},{"year":2023,"cited_by_count":228},{"year":2022,"cited_by_count":201},{"year":2021,"cited_by_count":265},{"year":2020,"cited_by_count":227},{"year":2019,"cited_by_count":223},{"year":2018,"cited_by_count":220},{"year":2017,"cited_by_count":240},{"year":2016,"cited_by_count":244},{"year":2015,"cited_by_count":236},{"year":2014,"cited_by_count":262},{"year":2013,"cited_by_count":255},{"year":2012,"cited_by_count":199}],"updated_date":"2026-05-09T13:55:54.758798","created_date":"2025-10-10T00:00:00"}