{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,22]],"date-time":"2025-10-22T10:10:15Z","timestamp":1761127815466},"reference-count":8,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1985,10,1]],"date-time":"1985-10-01T00:00:00Z","timestamp":496972800000},"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":10151,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1985,10]]},"DOI":"10.1016\/0166-218x(85)90066-6","type":"journal-article","created":{"date-parts":[[2002,9,17]],"date-time":"2002-09-17T12:34:42Z","timestamp":1032266082000},"page":"123-138","source":"Crossref","is-referenced-by-count":47,"title":["A polynomial time algorithm for finding the prime factors of cartesian-product graphs"],"prefix":"10.1016","volume":"12","author":[{"given":"Joan","family":"Feigenbaum","sequence":"first","affiliation":[]},{"given":"John","family":"Hershberger","sequence":"additional","affiliation":[]},{"given":"Alejandro A.","family":"Sch\u00e4ffer","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(85)90066-6_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0166-218X(85)90066-6_BIB2","doi-asserted-by":"crossref","unstructured":"J. Feigenbaum and A.A. Sch\u00e4ffer, Recognizing composite graphs is equivalent to testing graph isomorphism, SIAM J. Comput., to appear.","DOI":"10.1137\/0215045"},{"key":"10.1016\/0166-218X(85)90066-6_BIB3","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/367766.368168","article-title":"Algorithm 97: Shortest path","volume":"5","author":"Floyd","year":"1962","journal-title":"CACM"},{"key":"10.1016\/0166-218X(85)90066-6_BIB4","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1090\/S0002-9947-1985-0776391-5","article-title":"On isometric embeddings of graphs","volume":"288","author":"Graham","year":"1985","journal-title":"Trans. AMS"},{"key":"10.1016\/0166-218X(85)90066-6_BIB5","doi-asserted-by":"crossref","first-page":"446","DOI":"10.1007\/BF01162967","article-title":"Graph multiplication","volume":"72","author":"Sabidussi","year":"1960","journal-title":"Math. Z."},{"key":"10.1016\/0166-218X(85)90066-6_BIB6","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1016\/0095-8956(78)90002-3","article-title":"Stability of Cartesian Products","volume":"25","author":"Sims","year":"1978","journal-title":"J. Combin. Theory, Series B"},{"key":"10.1016\/0166-218X(85)90066-6_BIB7","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1145\/321879.321884","article-title":"Efficiency of a good but not linear set union algorithm","volume":"22","author":"Tarjan","year":"1975","journal-title":"JACM"},{"key":"10.1016\/0166-218X(85)90066-6_BIB8","unstructured":"P. Winkler, Private communication."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X85900666?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X85900666?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,9]],"date-time":"2019-04-09T13:22:39Z","timestamp":1554816159000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X85900666"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,10]]},"references-count":8,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1985,10]]}},"alternative-id":["0166218X85900666"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(85)90066-6","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1985,10]]}}}