{"id":"https://openalex.org/W2049105156","doi":"https://doi.org/10.1137/0203006","title":"Finding Dominators in Directed Graphs","display_name":"Finding Dominators in Directed Graphs","publication_year":1974,"publication_date":"1974-03-01","ids":{"openalex":"https://openalex.org/W2049105156","doi":"https://doi.org/10.1137/0203006","mag":"2049105156"},"language":"en","primary_location":{"id":"doi:10.1137/0203006","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0203006","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":[],"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":6.4834,"has_fulltext":false,"cited_by_count":219,"citation_normalized_percentile":{"value":0.9741319,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"3","issue":"1","first_page":"62","last_page":"89"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9994000196456909,"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.9994000196456909,"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.9980999827384949,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9957000017166138,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6882539987564087},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6167075037956238},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5491325259208679},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.547146737575531},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5174946784973145},{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.49883317947387695},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4748666286468506},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4472879469394684},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.440609335899353},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.43805450201034546},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4326429069042206},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.4257616698741913},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.34926262497901917},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.29499685764312744}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6882539987564087},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6167075037956238},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5491325259208679},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.547146737575531},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5174946784973145},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.49883317947387695},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4748666286468506},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4472879469394684},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.440609335899353},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.43805450201034546},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4326429069042206},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.4257616698741913},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.34926262497901917},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.29499685764312744},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0203006","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0203006","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1969148345","https://openalex.org/W1995405030","https://openalex.org/W2003312024","https://openalex.org/W2009767447","https://openalex.org/W2092576944","https://openalex.org/W2118382442","https://openalex.org/W2127637733","https://openalex.org/W2155803955","https://openalex.org/W2319346475","https://openalex.org/W4252391715"],"related_works":["https://openalex.org/W1992104669","https://openalex.org/W1870020915","https://openalex.org/W2018076478","https://openalex.org/W1581210843","https://openalex.org/W1529390395","https://openalex.org/W1982530285","https://openalex.org/W2887154986","https://openalex.org/W2804770727","https://openalex.org/W2611723985","https://openalex.org/W1838063489"],"abstract_inverted_index":{"This":[0,57],"paper":[1],"describes":[2],"an":[3,9],"algorithm":[4,14,91,105],"for":[5,21,72,92],"finding":[6,73,93],"dominators":[7,74,94],"in":[8,54,75,95],"arbitrary":[10,76],"directed":[11,77],"graph.":[12,56],"The":[13],"uses":[15],"depth-first":[16],"search":[17],"and":[18,26,47,79,109],"efficient":[19],"algorithms":[20,71],"computing":[22],"disjoint":[23],"set":[24],"unions":[25],"manipulating":[27],"priority":[28],"queues":[29],"to":[30,112],"achieve":[31],"a":[32,89,114],"time":[33,66,86,108],"bound":[34,58,67,87],"of":[35,45,52,68,88],"$O(V\\log":[36],"V":[37,41],"+":[38,64,83],"E)$":[39,85],"if":[40],"is":[42,49,110],"the":[43,50,55,62,81,103],"number":[44,51],"vertices":[46],"E":[48],"edges":[53],"compares":[59],"favorably":[60],"with":[61,80],"$O(V(V":[63],"E))$":[65],"previously":[69],"known":[70,90],"graphs,":[78],"$O(V":[82],"E\\log":[84],"reducible":[96],"graphs.":[97],"If":[98],"$E":[99],"\\geqq":[100],"V\\log":[101],"V$,":[102],"new":[104],"requires":[106],"$O(E)$":[107],"optimal":[111],"within":[113],"constant":[115],"factor.":[116]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":11},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}