{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:12:07Z","timestamp":1725495127031},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540429852"},{"type":"electronic","value":"9783540456780"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45678-3_13","type":"book-chapter","created":{"date-parts":[[2007,11,15]],"date-time":"2007-11-15T11:12:14Z","timestamp":1195125134000},"page":"136-147","source":"Crossref","is-referenced-by-count":1,"title":["Counting Graph Isomorphisms among Chordal Graphs with Restricted Clique Number"],"prefix":"10.1007","author":[{"given":"Takayuki","family":"Nagoya","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,12,4]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"L. Babai, D. Y. Grigor\u2019ev, and D.M. Mount, \u201cIsomorphism of graphs with bounded eigenvalue multiplicity\u201d, Proc.14th ACM STOC, pp.310\u2013324, 1982.","DOI":"10.1145\/800070.802206"},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1016\/0196-6774(90)90013-5","volume":"11","author":"H. L. Bodlaender","year":"1990","unstructured":"H. L. Bodlaender, \u201cPolynomial Algorithms for Graph Isomorphism and Chromatic Index on Partial k-Trees\u201d, Journal of Algorithms, vol.11, no., pp.631\u2013643, 1990.","journal-title":"Journal of Algorithms"},{"key":"13_CR3","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1006\/jagm.1996.0058","volume":"21","author":"L. Babel","year":"1996","unstructured":"L. Babel, I. N. Ponomarenko and G. Tinhofer, \u201cThe Isomorphism Problem For Directed Path Graphs and For Rooted Directed Path Graphs\u201d, Journal of Algorithms, vol.21, no., pp.542\u2013564, 1996.","journal-title":"Journal of Algorithms"},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1145\/322123.322125","volume":"26","author":"K. S. Booth","year":"1979","unstructured":"K. S. Booth and G. S. Lueker, \u201cA linear-time algorithm for deciding interval graph isomorphism\u201d, J. Assoc. Comput. Math. vol.26, pp.183\u2013195, 1979","journal-title":"J. Assoc. Comput. Math."},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0166-218X(81)90013-5","volume":"3","author":"D. G. Corneil","year":"1981","unstructured":"D. G. Corneil, H. Lerchs, and L. Stewart, \u201cComplement reducible graphs\u201d, Discrete Appl.Math. vol.3, pp.163\u2013174, 1981.","journal-title":"Discrete Appl.Math."},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"G. J. Colbourn, K. S. Booth, \u201cLinear time automorphism algorithms for trees, interval graphs and planar graphs\u201d, SIAM J. on Comput., pp.203\u2013225, 1981.","DOI":"10.1137\/0210015"},{"key":"13_CR7","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1002\/net.3230110103","volume":"11","author":"G. J. Colbourn","year":"1981","unstructured":"G. J. Colbourn, \u201cOn testing isomorphism of permutation graphs\u201d, Networks, vol.11, pp.13\u201321, 1981.","journal-title":"Networks"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"M. C. Golumbic, \u201cAlgorithmic Graph Theory and Perfect Graphs\u201d, Academic Press, 1980.","DOI":"10.1016\/B978-0-12-289260-8.50010-8"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"J. E. Hopcroft and J. K. Wong, \u201cLinear-time algorithm for isomorphism of planar graphs\u201d, Proc.6th ACM Symp. Theory of Computing, pp.172\u2013184, 1974.","DOI":"10.1145\/800119.803896"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"M. M. Klawe, D. G. Corneil and A. Proskurwski, \u201cIsomorphism testing in hookup classes\u201d, SIAM j. Alg. Disc. Meth., pp.260\u2013274, 1982.","DOI":"10.1137\/0603025"},{"key":"13_CR11","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/0022-0000(82)90009-5","volume":"25","author":"E. M. Luks","year":"1982","unstructured":"E. M. Luks, \u201cIsomorphism of graphs of bounded valence can be tested in polynomial time\u201d, J. Comput. System. Sci. vol.25, pp.42\u201365, 1982.","journal-title":"J. Comput. System. Sci."},{"key":"13_CR12","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0020-0190(79)90004-8","volume":"8","author":"R. Mathon","year":"1979","unstructured":"R. Mathon, \u201cA Note on The Graph Isomorphism Counting Problem,\u201d Inf. Process. lett., vol.8, no., pp.131\u2013132, 1979.","journal-title":"Inf. Process. lett."},{"key":"13_CR13","unstructured":"T. Nagoya, S. Tani, and S. Toda, \u201cA Polynomial-Time Algorithm for Counting Graph Isomorphisms among Partial k-trees,\u201d COMP98-24(1998-07)."},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"D. J. Rose, and R. E. Tarjan, \u201cAlgorihtmic Aspects of Vertex Elimination,\u201d Proc.7th Ann.ACM Symp.Theory of Computing, pp.245\u2013254,1975.","DOI":"10.1145\/800116.803775"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45678-3_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T09:18:33Z","timestamp":1556961513000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45678-3_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540429852","9783540456780"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-45678-3_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2001]]}}}