{"id":"https://openalex.org/W2008441811","doi":"https://doi.org/10.1145/22145.22166","title":"A linear algorithm for finding dominators in flow graphs and related problems","display_name":"A linear algorithm for finding dominators in flow graphs and related problems","publication_year":1985,"publication_date":"1985-01-01","ids":{"openalex":"https://openalex.org/W2008441811","doi":"https://doi.org/10.1145/22145.22166","mag":"2008441811"},"language":"en","primary_location":{"id":"doi:10.1145/22145.22166","is_oa":false,"landing_page_url":"https://doi.org/10.1145/22145.22166","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the seventeenth annual ACM symposium on Theory of computing  - STOC '85","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/A5074985275","display_name":"Dov Harel","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"D Harel","raw_affiliation_strings":["Intermetrics Inc., Cambridge, Massachusetts","Intermetrics, Inc. Cambridge, Massachusetts"],"affiliations":[{"raw_affiliation_string":"Intermetrics Inc., Cambridge, Massachusetts","institution_ids":[]},{"raw_affiliation_string":"Intermetrics, Inc. Cambridge, Massachusetts","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5074985275"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.502,"has_fulltext":false,"cited_by_count":113,"citation_normalized_percentile":{"value":0.81530495,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"185","last_page":"194"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9987999796867371,"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.9987999796867371,"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.996999979019165,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9958999752998352,"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/computer-science","display_name":"Computer science","score":0.6346930265426636},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5026986598968506},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.496376097202301},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4538674056529999},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.4237300157546997},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4142206907272339},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.35354524850845337},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.30096203088760376},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.22203588485717773}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6346930265426636},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5026986598968506},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.496376097202301},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4538674056529999},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.4237300157546997},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4142206907272339},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35354524850845337},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.30096203088760376},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.22203588485717773},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/22145.22166","is_oa":false,"landing_page_url":"https://doi.org/10.1145/22145.22166","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the seventeenth annual ACM symposium on Theory of computing  - STOC '85","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W2440755","https://openalex.org/W1513400187","https://openalex.org/W1551635709","https://openalex.org/W1655990431","https://openalex.org/W1986022261","https://openalex.org/W2003312024","https://openalex.org/W2011999472","https://openalex.org/W2023658462","https://openalex.org/W2030776771","https://openalex.org/W2049105156","https://openalex.org/W2049596277","https://openalex.org/W2088017390","https://openalex.org/W2091507391","https://openalex.org/W2092576944","https://openalex.org/W2111379929","https://openalex.org/W2118382442","https://openalex.org/W2160907067","https://openalex.org/W2163169902"],"related_works":["https://openalex.org/W3202999461","https://openalex.org/W4214624958","https://openalex.org/W4205332774","https://openalex.org/W4255883464","https://openalex.org/W2479510122","https://openalex.org/W2107423006","https://openalex.org/W937990293","https://openalex.org/W1968111265","https://openalex.org/W4249359625","https://openalex.org/W2593184009"],"abstract_inverted_index":{"In":[0,44,132],"the":[1,5,20,31,36,45,89,108,119,123,133,137,144,150,169,185,189,241],"first":[2,190,198],"part":[3,135,191],"of":[4,19,30,42,99,110,136,171,206],"paper":[6,138],"we":[7,52,139,243],"show":[8,140,227],"how":[9,141,228],"to":[10,26,56,142,218,229],"extend":[11,230],"recent":[12],"methods":[13],"for":[14,34,112,147,154,193,202,233],"solving":[15,113],"a":[16,27,54,96,203,247],"special":[17,28],"case":[18,29,120],"union-find":[21],"problem":[22,33],"in":[23,67,88,107,118,128,157,164,180,188,221],"linear":[24,165,181],"time,":[25],"eval-link-update":[32],"computing":[35,234],"minimum":[37],"function":[38],"defined":[39],"on":[40,64,236,246],"paths":[41],"trees.":[43],"cases":[46],"where":[47,93,121],"our":[48,231],"approach":[49],"is":[50,95],"applicable,":[51],"give":[53,199],"way":[55],"perform":[57],"m":[58],"eval,":[59],"link,":[60],"and":[61,72,85,173,183,213],"update":[62],"operations":[63],"n":[65],"elements":[66],"O(m":[68,77],"+":[69,79,82],"n)":[70,81,83],"time":[71,84,182],"O(n)":[73,86],"space,":[74],"improved":[75],"from":[76],"\u03b1(m":[78],"n,":[80],"space":[87],"more":[90],"general":[91],"case,":[92],"\u03b1":[94],"functional":[97],"inverse":[98],"Ackermans":[100],"function.":[101],"The":[102],"technique":[103,146,186,232],"gives":[104],"similar":[105],"improvements":[106],"efficiency":[109],"algorithms":[111,242],"several":[114],"network":[115],"optimization":[116],"problems":[117],"all":[122],"keys":[124],"involved":[125],"are":[126,177],"integers":[127],"some":[129],"suitable":[130],"range.":[131],"second":[134],"use":[143],"new":[145],"speeding":[148],"up":[149],"fastest":[151],"known":[152],"algorithm":[153,201],"finding":[155,194],"dominators":[156,175,220,235],"flow":[158,223,238],"graphs":[159,207],"so":[160],"that":[161],"it":[162],"runs":[163],"time.":[166],"We":[167,197,225],"introduce":[168],"notions":[170],"pseudo":[172],"external":[174],"which":[176,208],"both":[178],"computable":[179],"make":[184],"introduced":[187],"applicable":[192],"immediate":[195],"dominators.":[196],"an":[200],"limited":[204],"class":[205],"include":[209],"cycle":[210],"free":[211],"graphs,":[212],"thus":[214],"can":[215],"be":[216],"used":[217],"find":[219],"reducible":[222],"graphs.":[224],"then":[226],"any":[237],"graph.":[239],"All":[240],"describe":[244],"run":[245],"Random":[248],"Access":[249],"Machine.":[250]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}