{"id":"https://openalex.org/W2067384054","doi":"https://doi.org/10.1016/0020-0190(82)90064-3","title":"An optimal algorithm for sink-finding","display_name":"An optimal algorithm for sink-finding","publication_year":1982,"publication_date":"1982-05-01","ids":{"openalex":"https://openalex.org/W2067384054","doi":"https://doi.org/10.1016/0020-0190(82)90064-3","mag":"2067384054"},"language":"en","primary_location":{"id":"doi:10.1016/0020-0190(82)90064-3","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0020-0190(82)90064-3","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","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/A5067167053","display_name":"K. N. King","orcid":null},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"K.N. King","raw_affiliation_strings":["School of Information and Computer Science, Georgia Institute of Technology, Atlanta, GA 30332, U.S.A"],"affiliations":[{"raw_affiliation_string":"School of Information and Computer Science, Georgia Institute of Technology, Atlanta, GA 30332, U.S.A","institution_ids":["https://openalex.org/I130701444"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5013324512","display_name":"Barbara Smith-Thomas","orcid":null},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Barbara Smith-Thomas","raw_affiliation_strings":["School of Information and Computer Science, Georgia Institute of Technology, Atlanta, GA 30332, U.S.A"],"affiliations":[{"raw_affiliation_string":"School of Information and Computer Science, Georgia Institute of Technology, Atlanta, GA 30332, U.S.A","institution_ids":["https://openalex.org/I130701444"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5067167053"],"corresponding_institution_ids":["https://openalex.org/I130701444"],"apc_list":{"value":2200,"currency":"USD","value_usd":2200},"apc_paid":null,"fwci":0.5488,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.66357309,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"14","issue":"3","first_page":"109","last_page":"111"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9980000257492065,"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"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9980000257492065,"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.9776999950408936,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9715999960899353,"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/combinatorics","display_name":"Combinatorics","score":0.7781857252120972},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6120508909225464},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.557062566280365},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.5566866993904114},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5426045656204224},{"id":"https://openalex.org/keywords/adjacency-matrix","display_name":"Adjacency matrix","score":0.512201726436615},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5059787631034851},{"id":"https://openalex.org/keywords/transitive-relation","display_name":"Transitive relation","score":0.458334743976593},{"id":"https://openalex.org/keywords/adjacency-list","display_name":"Adjacency list","score":0.4312702417373657},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.38940978050231934},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.38548195362091064},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33563870191574097}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7781857252120972},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6120508909225464},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.557062566280365},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.5566866993904114},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5426045656204224},{"id":"https://openalex.org/C180356752","wikidata":"https://www.wikidata.org/wiki/Q727035","display_name":"Adjacency matrix","level":3,"score":0.512201726436615},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5059787631034851},{"id":"https://openalex.org/C191399111","wikidata":"https://www.wikidata.org/wiki/Q64861","display_name":"Transitive relation","level":2,"score":0.458334743976593},{"id":"https://openalex.org/C110484373","wikidata":"https://www.wikidata.org/wiki/Q264398","display_name":"Adjacency list","level":2,"score":0.4312702417373657},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.38940978050231934},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38548195362091064},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33563870191574097},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0020-0190(82)90064-3","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0020-0190(82)90064-3","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1514415888","https://openalex.org/W2107705503","https://openalex.org/W2147862220","https://openalex.org/W2752061190","https://openalex.org/W2752853835","https://openalex.org/W3133279294","https://openalex.org/W3198160809","https://openalex.org/W6744529318"],"related_works":["https://openalex.org/W2887981140","https://openalex.org/W2140262267","https://openalex.org/W2288515165","https://openalex.org/W1544697331","https://openalex.org/W3107333841","https://openalex.org/W2949386023","https://openalex.org/W2108100861","https://openalex.org/W4380080441","https://openalex.org/W4379983135","https://openalex.org/W2078895542"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}