{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T00:42:51Z","timestamp":1774053771243,"version":"3.50.1"},"reference-count":10,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1973,6,1]],"date-time":"1973-06-01T00:00:00Z","timestamp":107740800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,17]],"date-time":"2013-08-17T00:00:00Z","timestamp":1376697600000},"content-version":"vor","delay-in-days":14687,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1973,6]]},"DOI":"10.1016\/s0022-0000(73)80013-3","type":"journal-article","created":{"date-parts":[[2010,11,10]],"date-time":"2010-11-10T09:46:40Z","timestamp":1289382400000},"page":"323-331","source":"Crossref","is-referenced-by-count":56,"title":["A V log V algorithm for isomorphism of triconnected planar graphs"],"prefix":"10.1016","volume":"7","author":[{"given":"J.E.","family":"Hopcroft","sequence":"first","affiliation":[]},{"given":"R.E.","family":"Tarjan","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(73)80013-3_bib1","series-title":"IFIP Congress 71: Foundations of Information Processing, Proceedings","first-page":"174","article-title":"Linear time simulation of deterministic two-way pushdown automata","author":"Cook","year":"1972"},{"key":"10.1016\/S0022-0000(73)80013-3_bib2","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1145\/321556.321562","article-title":"An efficient algorithm for graph isomorphism","volume":"17","author":"Corneil","year":"1970","journal-title":"J. ACM"},{"key":"10.1016\/S0022-0000(73)80013-3_bib3","series-title":"Theory of Machines and Computations","article-title":"An n log n algorithm for minimizing states in a finite automation","author":"Hopcroft","year":"1972"},{"key":"10.1016\/S0022-0000(73)80013-3_bib4","article-title":"An n log n Algorithm for Isomorphism of Planar Triply Connected Graphs","author":"Hopcroft","year":"1971"},{"key":"10.1016\/S0022-0000(73)80013-3_bib5","article-title":"Efficient Planarity Testing","author":"Hopcroft","year":"1972"},{"key":"10.1016\/S0022-0000(73)80013-3_bib6","series-title":"Complexity of Computer Computations","article-title":"Isomorphism of planar graphs (working paper)","author":"Hopcroft","year":"1972"},{"key":"10.1016\/S0022-0000(73)80013-3_bib7","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1016\/0020-0190(71)90019-6","article-title":"A V2 algorithm for determining isomorphism of planar graphs","volume":"1","author":"Hopcroft","year":"1971","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0022-0000(73)80013-3_bib8","article-title":"An Efficient Planarity Algorithm","author":"Tarjan","year":"1971"},{"key":"10.1016\/S0022-0000(73)80013-3_bib9","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1109\/TCT.1966.1082573","article-title":"A simple and efficient algorithm for determining isomorphism of planar triply connected graphs","volume":"13","author":"Weinberg","year":"1966","journal-title":"IEEE Trans. on Circuit Theory"},{"key":"10.1016\/S0022-0000(73)80013-3_bib10","doi-asserted-by":"crossref","first-page":"231","DOI":"10.2307\/2371125","article-title":"A set of topological invariants for graphs","volume":"55","author":"Whitney","year":"1993","journal-title":"Amer. J. Math."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000073800133?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000073800133?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,12,6]],"date-time":"2018-12-06T23:52:29Z","timestamp":1544140349000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000073800133"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1973,6]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1973,6]]}},"alternative-id":["S0022000073800133"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(73)80013-3","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1973,6]]}}}