Sign In

Login

Password

Forgot Password ? Sign Up

Dominator (graph theory) (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Dominator (graph theory)" in English language version.

refsWebsite
Global rank English rank
7doi.org
2nd place
2nd place
6semanticscholar.org
11th place
8th place
4acm.org
1,185th place
840th place
3psu.edu
207th place
136th place
1sciencedirect.com
149th place
178th place
1worldcat.org
5th place
5th place
1eclipse.org
low place
8,992nd place
1web.archive.org
1st place
1st place
1uoi.gr
low place
low place
1rice.edu
3,843rd place
2,772nd place

acm.org

portal.acm.org

dl.acm.org

doi.org

  • Lengauer, Thomas; Tarjan, Robert Endre (July 1979). "A fast algorithm for finding dominators in a flowgraph". ACM Transactions on Programming Languages and Systems. 1 (1): 121–141. CiteSeerX 10.1.1.117.8843. doi:10.1145/357062.357071. S2CID 976012.
  • Prosser, Reese T. (1959). "Applications of Boolean matrices to the analysis of flow diagrams". AFIPS Joint Computer Conferences: Papers Presented at the December 1–3, 1959, Eastern Joint IRE-AIEE-ACM Computer Conference. IRE-AIEE-ACM '59 (Eastern): 133–138. doi:10.1145/1460299.1460314. S2CID 15546681.
  • Lowry, Edward S.; Medlock, Cleburne W. (January 1969). "Object code optimization". Communications of the ACM. 12 (1): 13–22. doi:10.1145/362835.362838. S2CID 16768560.
  • Cytron, Ron; Ferrante, Jeanne; Rosen, Barry K.; Wegman, Mark N.; Zadeck, F. Kenneth (1989). "An efficient method of computing static single assignment form". Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '89. POPL ’89. pp. 25–35. doi:10.1145/75277.75280. ISBN 0897912942. S2CID 8301431.
  • Tamrawi, Ahmed; Kothari, Suresh (2018-10-01). "Projected control graph for computing relevant program behaviors". Science of Computer Programming. 163: 93–114. doi:10.1016/j.scico.2018.04.003. ISSN 0167-6423.
  • Teslenko, Maxim; Dubrova, Elena (2005). "An Efficient Algorithm for Finding Double-Vertex Dominators in Circuit Graphs". Design, Automation and Test in Europe. Date '05. pp. 406–411. CiteSeerX 10.1.1.598.3053. doi:10.1109/DATE.2005.53. ISBN 9780769522883. S2CID 10305833.
  • Dubrova, Elena (2005). "Structural Testing Based on Minimum Kernels". Design, Automation and Test in Europe. Date '05. pp. 1168–1173. CiteSeerX 10.1.1.583.5547. doi:10.1109/DATE.2005.284. ISBN 9780769522883. S2CID 11439732.

eclipse.org

help.eclipse.org

  • "Dominator Tree". eclipse.org. SAP AG and IBM Corporation. 2012 [2008]. Retrieved 21 June 2013.

psu.edu

citeseerx.ist.psu.edu

  • Lengauer, Thomas; Tarjan, Robert Endre (July 1979). "A fast algorithm for finding dominators in a flowgraph". ACM Transactions on Programming Languages and Systems. 1 (1): 121–141. CiteSeerX 10.1.1.117.8843. doi:10.1145/357062.357071. S2CID 976012.
  • Teslenko, Maxim; Dubrova, Elena (2005). "An Efficient Algorithm for Finding Double-Vertex Dominators in Circuit Graphs". Design, Automation and Test in Europe. Date '05. pp. 406–411. CiteSeerX 10.1.1.598.3053. doi:10.1109/DATE.2005.53. ISBN 9780769522883. S2CID 10305833.
  • Dubrova, Elena (2005). "Structural Testing Based on Minimum Kernels". Design, Automation and Test in Europe. Date '05. pp. 1168–1173. CiteSeerX 10.1.1.583.5547. doi:10.1109/DATE.2005.284. ISBN 9780769522883. S2CID 11439732.

rice.edu

hipersoft.rice.edu

sciencedirect.com

semanticscholar.org

api.semanticscholar.org

  • Lengauer, Thomas; Tarjan, Robert Endre (July 1979). "A fast algorithm for finding dominators in a flowgraph". ACM Transactions on Programming Languages and Systems. 1 (1): 121–141. CiteSeerX 10.1.1.117.8843. doi:10.1145/357062.357071. S2CID 976012.
  • Prosser, Reese T. (1959). "Applications of Boolean matrices to the analysis of flow diagrams". AFIPS Joint Computer Conferences: Papers Presented at the December 1–3, 1959, Eastern Joint IRE-AIEE-ACM Computer Conference. IRE-AIEE-ACM '59 (Eastern): 133–138. doi:10.1145/1460299.1460314. S2CID 15546681.
  • Lowry, Edward S.; Medlock, Cleburne W. (January 1969). "Object code optimization". Communications of the ACM. 12 (1): 13–22. doi:10.1145/362835.362838. S2CID 16768560.
  • Cytron, Ron; Ferrante, Jeanne; Rosen, Barry K.; Wegman, Mark N.; Zadeck, F. Kenneth (1989). "An efficient method of computing static single assignment form". Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '89. POPL ’89. pp. 25–35. doi:10.1145/75277.75280. ISBN 0897912942. S2CID 8301431.
  • Teslenko, Maxim; Dubrova, Elena (2005). "An Efficient Algorithm for Finding Double-Vertex Dominators in Circuit Graphs". Design, Automation and Test in Europe. Date '05. pp. 406–411. CiteSeerX 10.1.1.598.3053. doi:10.1109/DATE.2005.53. ISBN 9780769522883. S2CID 10305833.
  • Dubrova, Elena (2005). "Structural Testing Based on Minimum Kernels". Design, Automation and Test in Europe. Date '05. pp. 1168–1173. CiteSeerX 10.1.1.583.5547. doi:10.1109/DATE.2005.284. ISBN 9780769522883. S2CID 11439732.

uoi.gr

cs.uoi.gr

web.archive.org

worldcat.org

search.worldcat.org