{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T08:40:51Z","timestamp":1648802451289},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1978,12,1]],"date-time":"1978-12-01T00:00:00Z","timestamp":281318400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[1978,12]]},"DOI":"10.1007\/bf02252027","type":"journal-article","created":{"date-parts":[[2005,11,15]],"date-time":"2005-11-15T13:20:34Z","timestamp":1132060834000},"page":"297-302","source":"Crossref","is-referenced-by-count":1,"title":["A remark on the time complexity of the subtree problem"],"prefix":"10.1007","volume":"19","author":[{"given":"M.","family":"Stadel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02252027_CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"A. V. Aho","year":"1974","unstructured":"Aho, A. V., Hopcroft, J. E., Ullman, J. D.: The Design and Analysis of Computer Algorithms. Reading: Addison-Wesley 1974."},{"key":"BF02252027_CR2","first-page":"449","volume":"17","author":"J. Edmonds","year":"1965","unstructured":"Edmonds, J.: Paths, Trees, and Flowers. Canadian J.17, 449\u2013467 (1965).","journal-title":"Canadian J."},{"key":"BF02252027_CR3","unstructured":"Even, S., Kariv, O.: An 0 (N 2.5) Algorithm for Maximum Matching in General Graphs, in: 16th Annual Symp. on Found. of Comp. Science. Oct. 1975, IEEE, pp. 100\u2013112."},{"key":"BF02252027_CR4","unstructured":"Fontet, M.: A Linear Algorithm for Testing Isomorphism of Planar Graphs. 3rd Int. Col. Aut. Lang. and Prog., Edinburgh (1976), pp. 411\u2013424."},{"key":"BF02252027_CR5","first-page":"72","volume":"31","author":"H. Gabov","year":"1972","unstructured":"Gabov, H.: An Efficient Implementation of Edmonds' Maximum Matching Algorithm. TR Stan-CS31, 72\u2013328 (1972).","journal-title":"TR Stan-CS"},{"key":"BF02252027_CR6","first-page":"47","volume":"6","author":"M. R. Garey","year":"1974","unstructured":"Garey, M. R., Johnson, D. S., Stockmeyer, L.: Some Simplified NP-Complete Problems. ACM SIGACT News6, 47\u201363 (1974).","journal-title":"ACM SIGACT News"},{"key":"BF02252027_CR7","doi-asserted-by":"crossref","first-page":"299 to 312","DOI":"10.1016\/0001-8708(72)90021-7","volume":"9","author":"L. H. Harper","year":"1972","unstructured":"Harper, L. H., Savage, J. E.: On the Complexity of the Marriage Problem. Adv. in Math.9, 299 to 312 (1972).","journal-title":"Adv. in Math."},{"key":"BF02252027_CR8","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"J. E. Hopcroft","year":"1973","unstructured":"Hopcroft, J. E., Karp, R. M.: Ann 5\/2-Algorithm for Maximum Matching in Bipartite Graphs. SIAM J. on Comp.2, 225\u2013231 (1973).","journal-title":"SIAM J. on Comp."},{"key":"BF02252027_CR9","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/S0022-0000(73)80013-3","volume":"7","author":"J. E. Hopcroft","year":"1973","unstructured":"Hopcroft, J. E., Tarjan, R. E.: AV logV Algorithm for Isomorphism of Triconnected Planar Graphs. J. Comp. Syst. Science7, 323\u2013331 (1973).","journal-title":"J. Comp. Syst. Science"},{"key":"BF02252027_CR10","first-page":"143","volume-title":"Complexity of Computer Computations","author":"J. E. Hopcroft","year":"1972","unstructured":"Hopcroft, J. E., Tarjan, R. E.: Isomorphism of Planar Graphs (working paper), in: Complexity of Computer Computations (Miller, R. E., Thatcher, J. W., eds.), pp. 143\u2013150. New York: Plenum Press 1972."},{"key":"BF02252027_CR11","first-page":"172","volume":"6","author":"J. E. Hopcroft","year":"1974","unstructured":"Hopcroft, J. E., Wong, J. K.: Linear Time Algorithm for Isomorphism of Planar Graphs. ACM SICACT News6, 172\u2013184 (1974).","journal-title":"ACM SICACT News"},{"key":"BF02252027_CR12","unstructured":"Stadel, M.: Bemerkungen zur Zeitkomplexit\u00e4t des Teilbaumproblems. Paper given at the WG 77 conference in Linz, 1977."},{"key":"BF02252027_CR13","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1109\/TCT.1966.1082573","volume":"13","author":"L. Weinberg","year":"1966","unstructured":"Weinberg, L.: A Simple and Efficient Algorithm for Determining Isomorphism of Planar Triply Connected Graphs. IEEE Trans. on Circuit Theory13, 142\u2013148 (1966).","journal-title":"IEEE Trans. on Circuit Theory"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02252027.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02252027\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02252027","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T14:46:06Z","timestamp":1558017966000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02252027"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1978,12]]},"references-count":13,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1978,12]]}},"alternative-id":["BF02252027"],"URL":"https:\/\/doi.org\/10.1007\/bf02252027","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[1978,12]]}}}