{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:31:52Z","timestamp":1759638712725},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319156118"},{"type":"electronic","value":"9783319156125"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-15612-5_30","type":"book-chapter","created":{"date-parts":[[2015,2,23]],"date-time":"2015-02-23T04:05:18Z","timestamp":1424664318000},"page":"329-334","source":"Crossref","is-referenced-by-count":2,"title":["Logspace and FPT Algorithms for Graph Isomorphism for Subclasses of Bounded Tree-Width Graphs"],"prefix":"10.1007","author":[{"given":"Bireswar","family":"Das","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Murali Krishna","family":"Enduri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"I. Vinod","family":"Reddy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"30_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/978-3-540-79709-8_8","volume-title":"Computer Science \u2013 Theory and Applications","author":"V. Arvind","year":"2008","unstructured":"Arvind, V., Das, B., K\u00f6bler, J.: A logspace algorithm for partial 2-tree canonization. In: Hirsch, E.A., Razborov, A.A., Semenov, A., Slissenko, A. (eds.) CSR 2008. LNCS, vol.\u00a05010, pp. 40\u201351. Springer, Heidelberg (2008)"},{"key":"30_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ic.2012.04.002","volume":"217","author":"V. Arvind","year":"2012","unstructured":"Arvind, V., Das, B., K\u00f6bler, J., Kuhnert, S.: The isomorphism problem for k-trees is complete for logspace. Information and Computation\u00a0217, 1\u201311 (2012)","journal-title":"Information and Computation"},{"key":"30_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/978-3-642-33293-7_21","volume-title":"Parameterized and Exact Computation","author":"A. Bouland","year":"2012","unstructured":"Bouland, A., Dawar, A., Kopczy\u0144ski, E.: On tractable parameterizations of graph isomorphism. In: Thilikos, D.M., Woeginger, G.J. (eds.) IPEC 2012. LNCS, vol.\u00a07535, pp. 218\u2013230. Springer, Heidelberg (2012)"},{"key":"30_CR4","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.ic.2012.05.003","volume":"217","author":"B. Das","year":"2012","unstructured":"Das, B., Tor\u00e1n, J., Wagner, F.: Restricted space algorithms for isomorphism on bounded treewidth graphs. Information and Computation\u00a0217, 71\u201383 (2012)","journal-title":"Information and Computation"},{"key":"30_CR5","doi-asserted-by":"crossref","unstructured":"Datta, S., Limaye, N., Nimbhorkar, P., Thierauf, T., Wagner, F.: Planar graph isomorphism is in log-space. In: Proceedings of 24th Annual IEEE Conference on Computational Complexity, pp. 203\u2013214. IEEE (2009)","DOI":"10.1109\/CCC.2009.16"},{"key":"30_CR6","unstructured":"Datta, S., Nimbhorkar, P., Thierauf, T., Wagner, F.: Graph isomorphism for K3,3-free and K5-free graphs is in log-space. In: LIPIcs-Leibniz International Proceedings in Informatics. vol.\u00a04. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2009)"},{"key":"30_CR7","volume-title":"Graph Theory Graduate Texts in Mathematics","author":"R. Diestel","year":"2000","unstructured":"Diestel, R.: Graph Theory Graduate Texts in Mathematics, vol.\u00a0173. Springer, GmbH & Company KG, Berlin and Heidelberg (2000)"},{"key":"30_CR8","unstructured":"Elberfeld, M., Jakoby, A., Tantau, T.: Algorithmic meta theorems for circuit classes of constant and logarithmic depth. In: Symposium on Theoretical Aspects of Computer Science, vol.\u00a014, pp. 66\u201377 (2012)"},{"issue":"3","key":"30_CR9","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/s004930050059","volume":"19","author":"S. Evdokimov","year":"1999","unstructured":"Evdokimov, S., Ponomarenko, I.: Isomorphism of coloured graphs with slowly increasing multiplicity of jordan blocks. Combinatorica\u00a019(3), 321\u2013333 (1999)","journal-title":"Combinatorica"},{"key":"30_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/978-3-642-13731-0_9","volume-title":"Algorithm Theory - SWAT 2010","author":"S. Kratsch","year":"2010","unstructured":"Kratsch, S., Schweitzer, P.: Isomorphism for graphs of bounded feedback vertex set number. In: Kaplan, H. (ed.) SWAT 2010. LNCS, vol.\u00a06139, pp. 81\u201392. Springer, Heidelberg (2010)"},{"key":"30_CR11","doi-asserted-by":"crossref","unstructured":"Lindell, S.: A logspace algorithm for tree canonization. In: Proceedings of the 24th Annual ACM Symposium on Theory of Computing, pp. 400\u2013404. ACM (1992)","DOI":"10.1145\/129712.129750"},{"key":"30_CR12","unstructured":"Lokshtanov, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Fixed-parameter tractable canonization and isomorphism test for graphs of bounded treewidth. In: FOCS (2014), \n                    \n                      http:\/\/arxiv.org\/abs\/1404.0818"},{"key":"30_CR13","doi-asserted-by":"crossref","unstructured":"Ne\u0161et\u0159il, J., De Mendez, P.O.: Sparsity: Graphs, Structures, and Algorithms, vol.\u00a028. Springer (2012)","DOI":"10.1007\/978-3-642-27875-4"},{"issue":"6","key":"30_CR14","doi-asserted-by":"publisher","first-page":"1022","DOI":"10.1016\/j.ejc.2005.01.010","volume":"27","author":"J. Ne\u0161et\u0159il","year":"2006","unstructured":"Ne\u0161et\u0159il, J., de Mendez, P.O.: Tree-depth, subgraph coloring and homomorphism bounds. European Journal of Combinatorics\u00a027(6), 1022\u20131041 (2006)","journal-title":"European Journal of Combinatorics"},{"key":"30_CR15","doi-asserted-by":"crossref","unstructured":"Reingold, O.: Undirected connectivity in log-space. J. ACM\u00a055(4), 17:1\u201317:24 (2008)","DOI":"10.1145\/1391289.1391291"},{"issue":"2","key":"30_CR16","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/PL00009273","volume":"24","author":"K. Yamazaki","year":"1999","unstructured":"Yamazaki, K., Bodlaender, H.L., de Fluiter, B., Thilikos, D.M.: Isomorphism for graphs of bounded distance width. Algorithmica\u00a024(2), 105\u2013127 (1999)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-15612-5_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T10:22:04Z","timestamp":1559125324000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-15612-5_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319156118","9783319156125"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-15612-5_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}