{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T05:08:31Z","timestamp":1777525711677,"version":"3.51.4"},"reference-count":5,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1976,9,1]],"date-time":"1976-09-01T00:00:00Z","timestamp":210384000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":13468,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1976,9]]},"DOI":"10.1016\/0304-3975(76)90086-4","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"339-344","source":"Crossref","is-referenced-by-count":183,"title":["Computing an st-numbering"],"prefix":"10.1016","volume":"2","author":[{"given":"Shimon","family":"Even","sequence":"first","affiliation":[]},{"given":"Robert Endre","family":"Tarjan","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(76)90086-4_BIB1","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1145\/362248.362272","article-title":"Algorithm 147: efficient algorithms for graph manipulation","volume":"16","author":"Hopcroft","year":"1973","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(76)90086-4_BIB2","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1145\/321850.321852","article-title":"Efficient planarity testing","volume":"21","author":"Hopcroft","year":"1974","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(76)90086-4_BIB3","series-title":"Theory of Graphs: International Symposium","first-page":"215","article-title":"An algorithm for planarity testing of graphs","author":"Lempel","year":"1967"},{"key":"10.1016\/0304-3975(76)90086-4_BIB4","first-page":"255","article-title":"Linear algorithms to recognize interval graphs and test for the consecutive ones properly","author":"Lueker","year":"1975","journal-title":"Proc. Seventh Annual ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(76)90086-4_BIB5","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","article-title":"Depth-first search and linear graph algorithms","volume":"1","author":"Tarjan","year":"1972","journal-title":"SIAM J. Comput."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397576900864?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397576900864?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:21:17Z","timestamp":1555125677000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397576900864"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1976,9]]},"references-count":5,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1976,9]]}},"alternative-id":["0304397576900864"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(76)90086-4","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1976,9]]}}}