{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:08:26Z","timestamp":1760202506797},"reference-count":13,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[1974,3]]},"DOI":"10.1137\/0203006","type":"journal-article","created":{"date-parts":[[2005,2,24]],"date-time":"2005-02-24T10:55:31Z","timestamp":1109242531000},"page":"62-89","source":"Crossref","is-referenced-by-count":144,"title":["Finding Dominators in Directed Graphs"],"prefix":"10.1137","volume":"3","author":[{"given":"Robert","family":"Tarjan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"351","reference":[{"key":"R1","volume-title":"The theory of parsing, translation, and compiling. Vol. II: Compiling","author":"Aho Alfred V.","year":"1973"},{"key":"R2","doi-asserted-by":"publisher","DOI":"10.1145\/362835.362838"},{"key":"R3","doi-asserted-by":"publisher","DOI":"10.1145\/361532.361566"},{"key":"R7","doi-asserted-by":"publisher","DOI":"10.1137\/0201014"},{"key":"R9","doi-asserted-by":"publisher","DOI":"10.1145\/390013.808479"},{"key":"R10","doi-asserted-by":"publisher","DOI":"10.1137\/0201010"},{"key":"R11","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_14"},{"key":"R12","doi-asserted-by":"publisher","DOI":"10.1137\/0202024"},{"key":"R16","unstructured":"Donald E. Knuth, The art of computer programming. Vol. 1: Fundamental algorithms, Second printing, Addison-Wesley Publishing Co., Reading, Mass.London-Don Mills, Ont, 1969, 258\u2013265MR02863170191.17903"},{"key":"R18","volume-title":"Finite graphs and networks: An introduction with applications","author":"Busacker Robert G.","year":"1965"},{"key":"R19","volume-title":"Structural models: An introduction to the theory of directed graphs","author":"Harary Frank","year":"1965"},{"key":"R20","volume-title":"Theory of graphs","author":"Ore Oystein","year":"1962"},{"key":"R21","doi-asserted-by":"publisher","DOI":"10.1145\/321679.321683"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/0203006","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,1,29]],"date-time":"2017-01-29T17:16:30Z","timestamp":1485710190000},"score":1,"resource":{"primary":{"URL":"http:\/\/epubs.siam.org\/doi\/10.1137\/0203006"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1974,3]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1974,3]]}},"alternative-id":["10.1137\/0203006"],"URL":"https:\/\/doi.org\/10.1137\/0203006","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[1974,3]]}}}