Editing Dominator (graph theory) (section)

== History ==
Dominance was first introduced by [[Reese Prosser|Reese T. Prosser]] in a 1959 paper on analysis of flow diagrams.<ref>{{cite book 
|last=Prosser 
|first=Reese T. 
|title=Papers presented at the December 1-3, 1959, eastern joint IRE-AIEE-ACM computer conference on - IRE-AIEE-ACM '59 (Eastern) 
|chapter=Applications of Boolean matrices to the analysis of flow diagrams 
|chapter-url=http://portal.acm.org/ft_gateway.cfm?id=1460314&type=pdf&coll=GUIDE&dl=GUIDE&CFID=79528182&CFTOKEN=33765747 
|pages=133–138 
|year=1959 |doi=10.1145/1460299.1460314 
|s2cid=15546681 
|author-link=Reese Prosser
}}</ref> Prosser did not present an algorithm for computing dominance, which had to wait ten years for Edward S. Lowry and C. W. Medlock.<ref>{{cite journal 
|title=Object code optimization 
|journal=Communications of the ACM 
|volume=12 
|issue=1 
|date=January 1969 
|pages=13–22 
|first=Edward S. 
|last=Lowry 
|author2=Medlock, Cleburne W.
|doi=10.1145/362835.362838|s2cid=16768560 
|doi-access=free 
}}</ref> Ron Cytron ''et al.'' rekindled interest in dominance in 1989 when they applied it to the problem of efficiently computing  the placement of φ functions, which are used in [[static single assignment form]].<ref>{{cite book
|first1=Ron
|last1=Cytron
|first2=Jeanne
|last2=Ferrante
|first3=Barry K.
|last3=Rosen
|first4=Mark N.
|last4=Wegman
|first5=F. Kenneth
|last5=Zadeck
|title=Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '89
|chapter=An efficient method of computing static single assignment form
|chapter-url = http://portal.acm.org/citation.cfm?doid=75277.75280
|doi = 10.1145/75277.75280
|isbn = 0897912942
|year=1989
|pages=25–35|s2cid=8301431
}}</ref>