{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,12]],"date-time":"2023-11-12T10:16:50Z","timestamp":1699784210503},"reference-count":3,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[1971,9,1]],"date-time":"1971-09-01T00:00:00Z","timestamp":52531200000},"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":[[1971,9]]},"DOI":"10.1007\/bf02234114","type":"journal-article","created":{"date-parts":[[2005,10,20]],"date-time":"2005-10-20T21:03:23Z","timestamp":1129842203000},"page":"329-334","source":"Crossref","is-referenced-by-count":7,"title":["Ein Verfahren zur Feststellung der Isomorphie von endlichen, zusammenh\u00e4ngenden Graphen"],"prefix":"10.1007","volume":"8","author":[{"given":"Walter","family":"Kn\u00f6del","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF02234114_CR1","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/BF02277220","volume":"3","author":"W. Kn\u00f6del","year":"1968","unstructured":"Kn\u00f6del, W.: Bestimmung aller maximalen, vollst\u00e4ndigen Teilgraphen eines GraphenG nach Stoffers. Computing3, 239\u2013240 (1968) und4, 75 (1969).","journal-title":"Computing"},{"key":"BF02234114_CR2","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1007\/BF02277215","volume":"3","author":"R. Albrecht","year":"1968","unstructured":"Albrecht, R.: Bestimmung minimaler Wege in endlichen, gerichteten, bewerteten Graphen. Computing3, 184\u2013193 (1968).","journal-title":"Computing"},{"key":"BF02234114_CR3","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1145\/363872.363899","volume":"7","author":"Stephen H. Unger","year":"1964","unstructured":"Unger, Stephen H.: GIT \u2014 A Heuristic Program for Testing Pairs of Directed Line Graphs for Isomorphism. Comm. of the ACM7, 26\u201334 (1964).","journal-title":"Comm. of the ACM"}],"container-title":["Computing"],"original-title":[],"language":"de","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02234114.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02234114\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02234114","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T12:45:37Z","timestamp":1557924337000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02234114"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1971,9]]},"references-count":3,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[1971,9]]}},"alternative-id":["BF02234114"],"URL":"https:\/\/doi.org\/10.1007\/bf02234114","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[1971,9]]}}}