A fast algorithm for finding dominators in a flow graph:
This paper presents a fast algorithm for finding dominators in a flow graph. The algorithm uses depth-first search and an efficient method of computing functions defined on paths in trees. A simple implementation of the algorithm runs in O(m log n) time, where m is the number of edges and n is the n...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Stanford, Calif.
1978
|
| Schriftenreihe: | Stanford University / Computer Science Department: Report STAN-CS
650 |
| Schlagworte: | |
| Zusammenfassung: | This paper presents a fast algorithm for finding dominators in a flow graph. The algorithm uses depth-first search and an efficient method of computing functions defined on paths in trees. A simple implementation of the algorithm runs in O(m log n) time, where m is the number of edges and n is the number of vertices in the problem graph. A sophisticated implementation runs in O(M alpha (m, n)) time, where alpha(m, n) is a functional inverse of Ackermann's function. Both versions of the algorithm were implemented in Algol W, and tested on an IBM 370/168. The programs were compared with an implementation by Purdom and Moore of a straightforward O(mn) - time algorithm, and with a bit vector algorithm. The fast algorithm beat the straightforward algorithm and the bit vector algorithm on all but the smallest graphs tests. |
| Beschreibung: | 40 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009075628 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940227s1978 |||| 00||| eng d | ||
| 035 | |a (OCoLC)227494654 | ||
| 035 | |a (DE-599)BVBBV009075628 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Lengauer, Thomas |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a A fast algorithm for finding dominators in a flow graph |c Thomas Lengauer ; Robert E. Tarjan* |
| 264 | 1 | |a Stanford, Calif. |c 1978 | |
| 300 | |a 40 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Stanford University / Computer Science Department: Report STAN-CS |v 650 | |
| 520 | 3 | |a This paper presents a fast algorithm for finding dominators in a flow graph. The algorithm uses depth-first search and an efficient method of computing functions defined on paths in trees. A simple implementation of the algorithm runs in O(m log n) time, where m is the number of edges and n is the number of vertices in the problem graph. A sophisticated implementation runs in O(M alpha (m, n)) time, where alpha(m, n) is a functional inverse of Ackermann's function. Both versions of the algorithm were implemented in Algol W, and tested on an IBM 370/168. The programs were compared with an implementation by Purdom and Moore of a straightforward O(mn) - time algorithm, and with a bit vector algorithm. The fast algorithm beat the straightforward algorithm and the bit vector algorithm on all but the smallest graphs tests. | |
| 650 | 4 | |a Search theory | |
| 650 | 4 | |a Trees(Mathematics) | |
| 650 | 7 | |a Algorithms |2 dtict | |
| 650 | 7 | |a Graphs |2 dtict | |
| 650 | 7 | |a Searching |2 dtict | |
| 650 | 7 | |a Theoretical Mathematics |2 scgdst | |
| 700 | 1 | |a Tarjan, Robert E. |e Verfasser |4 aut | |
| 810 | 2 | |a Computer Science Department: Report STAN-CS |t Stanford University |v 650 |w (DE-604)BV008928280 |9 650 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006012969 | ||
Datensatz im Suchindex
| _version_ | 1804123489394753536 |
|---|---|
| any_adam_object | |
| author | Lengauer, Thomas Tarjan, Robert E. |
| author_facet | Lengauer, Thomas Tarjan, Robert E. |
| author_role | aut aut |
| author_sort | Lengauer, Thomas |
| author_variant | t l tl r e t re ret |
| building | Verbundindex |
| bvnumber | BV009075628 |
| ctrlnum | (OCoLC)227494654 (DE-599)BVBBV009075628 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01987nam a2200361 cb4500</leader><controlfield tag="001">BV009075628</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940227s1978 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)227494654</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009075628</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-29T</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Lengauer, Thomas</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A fast algorithm for finding dominators in a flow graph</subfield><subfield code="c">Thomas Lengauer ; Robert E. Tarjan*</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Stanford, Calif.</subfield><subfield code="c">1978</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">40 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Stanford University / Computer Science Department: Report STAN-CS</subfield><subfield code="v">650</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">This paper presents a fast algorithm for finding dominators in a flow graph. The algorithm uses depth-first search and an efficient method of computing functions defined on paths in trees. A simple implementation of the algorithm runs in O(m log n) time, where m is the number of edges and n is the number of vertices in the problem graph. A sophisticated implementation runs in O(M alpha (m, n)) time, where alpha(m, n) is a functional inverse of Ackermann's function. Both versions of the algorithm were implemented in Algol W, and tested on an IBM 370/168. The programs were compared with an implementation by Purdom and Moore of a straightforward O(mn) - time algorithm, and with a bit vector algorithm. The fast algorithm beat the straightforward algorithm and the bit vector algorithm on all but the smallest graphs tests.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Search theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Trees(Mathematics)</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Algorithms</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Graphs</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Searching</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Theoretical Mathematics</subfield><subfield code="2">scgdst</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Tarjan, Robert E.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Computer Science Department: Report STAN-CS</subfield><subfield code="t">Stanford University</subfield><subfield code="v">650</subfield><subfield code="w">(DE-604)BV008928280</subfield><subfield code="9">650</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006012969</subfield></datafield></record></collection> |
| id | DE-604.BV009075628 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:30:35Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006012969 |
| oclc_num | 227494654 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 40 S. |
| publishDate | 1978 |
| publishDateSearch | 1978 |
| publishDateSort | 1978 |
| record_format | marc |
| series2 | Stanford University / Computer Science Department: Report STAN-CS |
| spelling | Lengauer, Thomas Verfasser aut A fast algorithm for finding dominators in a flow graph Thomas Lengauer ; Robert E. Tarjan* Stanford, Calif. 1978 40 S. txt rdacontent n rdamedia nc rdacarrier Stanford University / Computer Science Department: Report STAN-CS 650 This paper presents a fast algorithm for finding dominators in a flow graph. The algorithm uses depth-first search and an efficient method of computing functions defined on paths in trees. A simple implementation of the algorithm runs in O(m log n) time, where m is the number of edges and n is the number of vertices in the problem graph. A sophisticated implementation runs in O(M alpha (m, n)) time, where alpha(m, n) is a functional inverse of Ackermann's function. Both versions of the algorithm were implemented in Algol W, and tested on an IBM 370/168. The programs were compared with an implementation by Purdom and Moore of a straightforward O(mn) - time algorithm, and with a bit vector algorithm. The fast algorithm beat the straightforward algorithm and the bit vector algorithm on all but the smallest graphs tests. Search theory Trees(Mathematics) Algorithms dtict Graphs dtict Searching dtict Theoretical Mathematics scgdst Tarjan, Robert E. Verfasser aut Computer Science Department: Report STAN-CS Stanford University 650 (DE-604)BV008928280 650 |
| spellingShingle | Lengauer, Thomas Tarjan, Robert E. A fast algorithm for finding dominators in a flow graph Search theory Trees(Mathematics) Algorithms dtict Graphs dtict Searching dtict Theoretical Mathematics scgdst |
| title | A fast algorithm for finding dominators in a flow graph |
| title_auth | A fast algorithm for finding dominators in a flow graph |
| title_exact_search | A fast algorithm for finding dominators in a flow graph |
| title_full | A fast algorithm for finding dominators in a flow graph Thomas Lengauer ; Robert E. Tarjan* |
| title_fullStr | A fast algorithm for finding dominators in a flow graph Thomas Lengauer ; Robert E. Tarjan* |
| title_full_unstemmed | A fast algorithm for finding dominators in a flow graph Thomas Lengauer ; Robert E. Tarjan* |
| title_short | A fast algorithm for finding dominators in a flow graph |
| title_sort | a fast algorithm for finding dominators in a flow graph |
| topic | Search theory Trees(Mathematics) Algorithms dtict Graphs dtict Searching dtict Theoretical Mathematics scgdst |
| topic_facet | Search theory Trees(Mathematics) Algorithms Graphs Searching Theoretical Mathematics |
| volume_link | (DE-604)BV008928280 |
| work_keys_str_mv | AT lengauerthomas afastalgorithmforfindingdominatorsinaflowgraph AT tarjanroberte afastalgorithmforfindingdominatorsinaflowgraph |