{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T12:43:08Z","timestamp":1725453788348},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642387678"},{"type":"electronic","value":"9783642387685"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38768-5_42","type":"book-chapter","created":{"date-parts":[[2013,5,17]],"date-time":"2013-05-17T04:31:28Z","timestamp":1368765088000},"page":"469-480","source":"Crossref","is-referenced-by-count":2,"title":["A Linear-Time Algorithm for Computing the Prime Decomposition of a Directed Graph with Regard to the Cartesian Product"],"prefix":"10.1007","author":[{"given":"Christophe","family":"Crespelle","sequence":"first","affiliation":[]},{"given":"Eric","family":"Thierry","sequence":"additional","affiliation":[]},{"given":"Thomas","family":"Lambert","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"42_CR1","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/BF01200428","volume":"2","author":"F. Aurenhammer","year":"1992","unstructured":"Aurenhammer, F., Hagauer, J., Imrich, W.: Cartesian graph factorization at logarithmic cost per edge. Computational Complexity\u00a02, 331\u2013349 (1992)","journal-title":"Computational Complexity"},{"issue":"1","key":"42_CR2","doi-asserted-by":"publisher","first-page":"51","DOI":"10.4007\/annals.2006.164.51","volume":"164","author":"M. Chudnovsky","year":"2006","unstructured":"Chudnovsky, M., Robertson, N., Seymour, P., Thomas, R.: The strong perfect graph theorem. Annals of Mathematics\u00a0164(1), 51\u2013229 (2006)","journal-title":"Annals of Mathematics"},{"key":"42_CR3","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1002\/jgt.3190160508","volume":"16","author":"T. Feder","year":"1992","unstructured":"Feder, T.: Product graph representations. Journal of Graph Theory\u00a016, 467\u2013488 (1992)","journal-title":"Journal of Graph Theory"},{"key":"42_CR4","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/0166-218X(86)90023-5","volume":"15","author":"J. Feigenbaum","year":"1986","unstructured":"Feigenbaum, J.: Directed cartesian-product graphs have unique factorizations that can be computed in polynomial time. Discr. Appl. Math.\u00a015, 105\u2013110 (1986)","journal-title":"Discr. Appl. Math."},{"key":"42_CR5","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/0166-218X(85)90066-6","volume":"12","author":"J. Feigenbaum","year":"1985","unstructured":"Feigenbaum, J., Hershberger, J., Sch\u00e4ffer, A.A.: A polynomial time algorithm for finding the prime factors of cartesian-product graphs. Discrete Applied Mathematics\u00a012, 123\u2013138 (1985)","journal-title":"Discrete Applied Mathematics"},{"key":"42_CR6","doi-asserted-by":"crossref","unstructured":"Hammack, R., Imrich, W., Klavzar, S.: Handbook of Product Graphs. CRC Press (2011)","DOI":"10.1201\/b10959"},{"issue":"3-5","key":"42_CR7","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1016\/j.disc.2005.09.038","volume":"307","author":"W. Imrich","year":"2007","unstructured":"Imrich, W., Peterin, I.: Recognizing cartesian products in linear time. Discrete Mathematics\u00a0307(3-5), 472\u2013483 (2007)","journal-title":"Discrete Mathematics"},{"key":"42_CR8","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1016\/j.jlap.2008.02.003","volume":"76","author":"M. Krebs","year":"2008","unstructured":"Krebs, M., Schmid, J.: Ordering the order of a distributive lattice by itself. Journal of Logic and Algebraic Programming\u00a076, 198\u2013208 (2008)","journal-title":"Journal of Logic and Algebraic Programming"},{"issue":"1","key":"42_CR9","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1007\/BF01162967","volume":"72","author":"G. Sabidussi","year":"1960","unstructured":"Sabidussi, G.: Graph multiplication. Mathematische Zeitschrift\u00a072(1), 446\u2013457 (1960)","journal-title":"Mathematische Zeitschrift"},{"key":"42_CR10","doi-asserted-by":"crossref","unstructured":"Spinrad, J.P.: Efficient graph representations. Fields Institute Monographs, vol.\u00a019. American Mathematical Society (2003)","DOI":"10.1090\/fim\/019"},{"key":"42_CR11","first-page":"30","volume":"9","author":"V.G. Vizing","year":"1963","unstructured":"Vizing, V.G.: The cartesian product of graphs. Vy\u010disl. Sistemy\u00a09, 30\u201343 (1963)","journal-title":"Vy\u010disl. Sistemy"},{"issue":"2","key":"42_CR12","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1016\/0095-8956(87)90018-9","volume":"43","author":"J.W. Walker","year":"1987","unstructured":"Walker, J.W.: Strict refinement for graphs and digraphs. Journal of Combinatorial Theory Series B\u00a043(2), 140\u2013150 (1987)","journal-title":"Journal of Combinatorial Theory Series B"},{"key":"42_CR13","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/S0195-6698(87)80012-4","volume":"8","author":"P.M. Winkler","year":"1987","unstructured":"Winkler, P.M.: Factoring a graph in polynomial time. European Journal on Combinatorics\u00a08, 209\u2013212 (1987)","journal-title":"European Journal on Combinatorics"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38768-5_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,13]],"date-time":"2019-07-13T22:22:42Z","timestamp":1563056562000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38768-5_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642387678","9783642387685"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38768-5_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}