{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,5,1]],"date-time":"2022-05-01T04:15:47Z","timestamp":1651378547355},"reference-count":14,"publisher":"Elsevier BV","issue":"12","license":[{"start":{"date-parts":[[2015,12,1]],"date-time":"2015-12-01T00:00:00Z","timestamp":1448928000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2019,12,6]],"date-time":"2019-12-06T00:00:00Z","timestamp":1575590400000},"content-version":"vor","delay-in-days":1466,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100007339","name":"Vietnam Institute for Advanced Study in Mathematics","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100007339","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[2015,12]]},"DOI":"10.1016\/j.disc.2015.06.001","type":"journal-article","created":{"date-parts":[[2015,7,1]],"date-time":"2015-07-01T21:45:17Z","timestamp":1435787117000},"page":"2393-2407","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":3,"title":["Computing the directed Cartesian-product decomposition of a directed graph from its undirected decomposition in linear time"],"prefix":"10.1016","volume":"338","author":[{"given":"Christophe","family":"Crespelle","sequence":"first","affiliation":[]},{"given":"Eric","family":"Thierry","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.disc.2015.06.001_br000005","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/BF01200428","article-title":"Cartesian graph factorization at logarithmic cost per edge","volume":"2","author":"Aurenhammer","year":"1992","journal-title":"Comput. Complexity"},{"issue":"1","key":"10.1016\/j.disc.2015.06.001_br000010","doi-asserted-by":"crossref","first-page":"51","DOI":"10.4007\/annals.2006.164.51","article-title":"The strong perfect graph theorem","volume":"164","author":"Chudnovsky","year":"2006","journal-title":"Ann. of Math."},{"key":"10.1016\/j.disc.2015.06.001_br000015","series-title":"COCOON 2013","first-page":"469","article-title":"A linear-time algorithm for computing the prime decomposition of a directed graph with regard to the cartesian product","volume":"vol. 7936","author":"Crespelle","year":"2013"},{"key":"10.1016\/j.disc.2015.06.001_br000020","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1002\/jgt.3190160508","article-title":"Product graph representations","volume":"16","author":"Feder","year":"1992","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.disc.2015.06.001_br000025","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0166-218X(86)90023-5","article-title":"Directed cartesian-product graphs have unique factorizations that can be computed in polynomial time","volume":"15","author":"Feigenbaum","year":"1986","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.disc.2015.06.001_br000030","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0166-218X(85)90066-6","article-title":"A polynomial time algorithm for finding the prime factors of cartesian-product graphs","volume":"12","author":"Feigenbaum","year":"1985","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.disc.2015.06.001_br000035","series-title":"Handbook of Product Graphs","author":"Hammack","year":"2011"},{"issue":"3\u20135","key":"10.1016\/j.disc.2015.06.001_br000040","doi-asserted-by":"crossref","first-page":"472","DOI":"10.1016\/j.disc.2005.09.038","article-title":"Recognizing cartesian products in linear time","volume":"307","author":"Imrich","year":"2007","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2015.06.001_br000045","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1016\/j.jlap.2008.02.003","article-title":"Ordering the order of a distributive lattice by itself","volume":"76","author":"Krebs","year":"2008","journal-title":"J. Log. Agebr. Program."},{"issue":"1","key":"10.1016\/j.disc.2015.06.001_br000050","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\/j.disc.2015.06.001_br000055","article-title":"Efficient graph representations","volume":"vol.~19","author":"Spinrad","year":"2003"},{"key":"10.1016\/j.disc.2015.06.001_br000060","first-page":"30","article-title":"The cartesian product of graphs","volume":"9","author":"Vizing","year":"1963","journal-title":"Vyisl. Sistemy"},{"issue":"2","key":"10.1016\/j.disc.2015.06.001_br000065","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1016\/0095-8956(87)90018-9","article-title":"Strict refinement for graphs and digraphs","volume":"43","author":"Walker","year":"1987","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.disc.2015.06.001_br000070","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/S0195-6698(87)80012-4","article-title":"Factoring a graph in polynomial time","volume":"8","author":"Winkler","year":"1987","journal-title":"Eur. J. Comb."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X15002253?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X15002253?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,4,3]],"date-time":"2021-04-03T10:08:05Z","timestamp":1617444485000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X15002253"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12]]},"references-count":14,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2015,12]]}},"alternative-id":["S0012365X15002253"],"URL":"https:\/\/doi.org\/10.1016\/j.disc.2015.06.001","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2015,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Computing the directed Cartesian-product decomposition of a directed graph from its undirected decomposition in linear time","name":"articletitle","label":"Article Title"},{"value":"Discrete Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.disc.2015.06.001","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2015 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}