{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T17:45:20Z","timestamp":1743097520504,"version":"3.40.3"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319751719"},{"type":"electronic","value":"9783319751726"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-75172-6_22","type":"book-chapter","created":{"date-parts":[[2018,1,30]],"date-time":"2018-01-30T11:23:02Z","timestamp":1517311382000},"page":"252-264","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On the Parallel Parameterized Complexity of the Graph Isomorphism Problem"],"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","published-online":{"date-parts":[[2018,1,31]]},"reference":[{"key":"22_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804090","volume-title":"Computational Complexity: A Modern Approach","author":"S Arora","year":"2009","unstructured":"Arora, S., Barak, B.: Computational Complexity: A Modern Approach. Cambridge University Press, Cambridge (2009)"},{"key":"22_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/3-540-10854-8_4","volume-title":"Fundamentals of Computation Theory","author":"L Babai","year":"1981","unstructured":"Babai, L.: Moderately exponential bound for graph isomorphism. In: G\u00e9cseg, F. (ed.) FCT 1981. LNCS, vol. 117, pp. 34\u201350. Springer, Heidelberg (1981). https:\/\/doi.org\/10.1007\/3-540-10854-8_4"},{"key":"22_CR3","doi-asserted-by":"crossref","unstructured":"Babai, L.: A Las Vegas-NC algorithm for isomorphism of graphs with bounded multiplicity of eigenvalues. In: 27th Annual Symposium on Foundations of Computer Science, pp. 303\u2013312. IEEE (1986)","DOI":"10.1109\/SFCS.1986.1"},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"Babai, L.: Graph isomorphism in quasipolynomial time. In: 48th Annual ACM SIGACT Symposium on Theory of Computing, pp. 684\u2013697. ACM (2016)","DOI":"10.1145\/2897518.2897542"},{"key":"22_CR5","unstructured":"Bannach, M., Stockhusen, C., Tantau, T.: Fast parallel fixed-parameter algorithms via color coding. In: Parameterized and Exact Computation, p. 224 (2015)"},{"issue":"4","key":"22_CR6","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1016\/0196-6774(90)90013-5","volume":"11","author":"HL Bodlaender","year":"1990","unstructured":"Bodlaender, H.L.: Polynomial algorithms for graph isomorphism and chromatic index on partial $$k$$-trees. J. Algorithms 11(4), 631\u2013643 (1990)","journal-title":"J. Algorithms"},{"issue":"2","key":"22_CR7","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/0020-0190(87)90232-8","volume":"25","author":"RB Boppana","year":"1987","unstructured":"Boppana, R.B., Hastad, J., Zachos, S.: Does co-NP have short interactive proofs? Inform. Process. Lett. 25(2), 127\u2013132 (1987)","journal-title":"Inform. Process. Lett."},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"Bouland, A., Dawar, A., Kopczy\u0144ski, E.: On tractable parameterizations of graph isomorphism. In: Parameterized and Exact Computation, pp. 218\u2013230 (2012)","DOI":"10.1007\/978-3-642-33293-7_21"},{"issue":"2","key":"22_CR9","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/s00453-015-0045-3","volume":"75","author":"J Bulian","year":"2016","unstructured":"Bulian, J., Dawar, A.: Graph isomorphism parameterized by elimination distance to bounded degree. Algorithmica 75(2), 363\u2013382 (2016)","journal-title":"Algorithmica"},{"issue":"3","key":"22_CR10","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1137\/0222038","volume":"22","author":"JF Buss","year":"1993","unstructured":"Buss, J.F., Goldsmith, J.: Nondeterminism within P*. SIAM J. Comput. 22(3), 560\u2013572 (1993)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"22_CR11","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0020-0190(96)00050-6","volume":"58","author":"L Cai","year":"1996","unstructured":"Cai, L.: Fixed-parameter tractability of graph modification problems for hereditary properties. Inform. Process. Lett. 58(4), 171\u2013176 (1996)","journal-title":"Inform. Process. Lett."},{"issue":"1","key":"22_CR12","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/S0168-0072(95)00020-8","volume":"84","author":"L Cai","year":"1997","unstructured":"Cai, L., Chen, J., Downey, R.G., Fellows, M.R.: Advice classes of parameterized tractability. Ann. Pure Appl. Logic 84(1), 119\u2013138 (1997)","journal-title":"Ann. Pure Appl. Logic"},{"key":"22_CR13","unstructured":"Cai, L., Chen, J., Downey, R.G., Fellows, M.R.: Advice classes of parameterized tractability-corrigendum (2017)"},{"key":"22_CR14","unstructured":"Chandoo, M.: Deciding circular-arc graph isomorphism in parameterized logspace. In: 33rd Symposium on Theoretical Aspects of Computer Science (2016)"},{"issue":"40\u201342","key":"22_CR15","doi-asserted-by":"publisher","first-page":"3736","DOI":"10.1016\/j.tcs.2010.06.026","volume":"411","author":"J Chen","year":"2010","unstructured":"Chen, J., Kanj, I.A., Xia, G.: Improved upper bounds for vertex cover. Theoret. Comput. Sci. 411(40\u201342), 3736\u20133756 (2010)","journal-title":"Theoret. Comput. Sci."},{"key":"22_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/978-3-319-15612-5_30","volume-title":"WALCOM: Algorithms and Computation","author":"B Das","year":"2015","unstructured":"Das, B., Enduri, M.K., Reddy, I.V.: Logspace and FPT algorithms for graph isomorphism for subclasses of bounded tree-width graphs. In: Rahman, M.S., Tomita, E. (eds.) WALCOM 2015. LNCS, vol. 8973, pp. 329\u2013334. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-15612-5_30"},{"key":"22_CR17","doi-asserted-by":"crossref","unstructured":"Das, B., Enduri, M.K., Reddy, I.V.: On the parallel parameterized complexity of the graph isomorphism problem. arXiv preprint arXiv:1711.08885 (2017)","DOI":"10.1007\/978-3-319-75172-6_22"},{"key":"22_CR18","doi-asserted-by":"crossref","unstructured":"Datta, S., Limaye, N., Nimbhorkar, P., Thierauf, T., Wagner, F.: Planar graph isomorphism is in log-space. In: 24th Annual IEEE Conference on Computational Complexity, pp. 203\u2013214 (2009)","DOI":"10.1109\/CCC.2009.16"},{"key":"22_CR19","unstructured":"Datta, S., Nimbhorkar, P., Thierauf, T., Wagner, F.: Graph isomorphism for K$$_{3,3}$$-free and K$$_5$$-free graphs is in log-space. In: LIPIcs-Leibniz International Proceedings in Informatics, vol. 4 (2009)"},{"key":"22_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-5559-1","volume-title":"Fundamentals of Parameterized Complexity","author":"RG Downey","year":"2013","unstructured":"Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity. Springer Science & Business Media, London (2013). https:\/\/doi.org\/10.1007\/978-1-4471-5559-1"},{"key":"22_CR21","unstructured":"Elberfeld, M., Schweitzer, P.: Canonizing graphs of bounded tree width in logspace. In: 33rd Symposium on Theoretical Aspects of Computer Science (2016)"},{"key":"22_CR22","doi-asserted-by":"crossref","unstructured":"Elberfeld, M., Stockhusen, C., Tantau, T.: On the space complexity of parameterized problems. In: Parameterized and Exact Computation, pp. 206\u2013217 (2012)","DOI":"10.1007\/978-3-642-33293-7_20"},{"issue":"2","key":"22_CR23","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/S0890-5401(03)00161-5","volume":"187","author":"J Flum","year":"2003","unstructured":"Flum, J., Grohe, M.: Describing parameterized complexity classes. Inf. Comput. 187(2), 291\u2013319 (2003)","journal-title":"Inf. Comput."},{"issue":"2","key":"22_CR24","first-page":"77","volume":"17","author":"R Ganian","year":"2015","unstructured":"Ganian, R.: Improving vertex cover as a graph parameter. Discrete Math. Theoret. Comput. Sci. 17(2), 77\u2013100 (2015)","journal-title":"Discrete Math. Theoret. Comput. Sci."},{"key":"22_CR25","doi-asserted-by":"crossref","unstructured":"Gru\u00dfien, B.: Capturing polynomial time using modular decomposition. In: 32nd Annual Symposium on Logic in Computer Science (LICS), pp. 1\u201312 (2017)","DOI":"10.1109\/LICS.2017.8005123"},{"key":"22_CR26","doi-asserted-by":"crossref","unstructured":"Hopcroft, J.E., Wong, J.K.: Linear time algorithm for isomorphism of planar graphs (preliminary report). In: Proceedings of the Sixth Annual ACM Symposium on Theory of Computing, pp. 172\u2013184. ACM (1974)","DOI":"10.1145\/800119.803896"},{"issue":"5","key":"22_CR27","doi-asserted-by":"publisher","first-page":"1292","DOI":"10.1137\/10080395X","volume":"40","author":"J K\u00f6bler","year":"2011","unstructured":"K\u00f6bler, J., Kuhnert, S., Laubner, B., Verbitsky, O.: Interval graphs: canonical representations in logspace. SIAM J. Comput. 40(5), 1292\u20131315 (2011)","journal-title":"SIAM J. Comput."},{"key":"22_CR28","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. 6139, pp. 81\u201392. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13731-0_9"},{"key":"22_CR29","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"},{"issue":"1","key":"22_CR30","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1137\/140999980","volume":"46","author":"D Lokshtanov","year":"2017","unstructured":"Lokshtanov, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Fixed-parameter tractable canonization and isomorphism test for graphs of bounded treewidth. SIAM J. Comput. 46(1), 161\u2013189 (2017)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"22_CR31","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/0022-0000(82)90009-5","volume":"25","author":"EM Luks","year":"1982","unstructured":"Luks, E.M.: Isomorphism of graphs of bounded valence can be tested in polynomial time. J. Comput. Syst. Sci. 25(1), 42\u201365 (1982)","journal-title":"J. Comput. Syst. Sci."},{"key":"22_CR32","doi-asserted-by":"crossref","unstructured":"Luks, E.M.: Parallel algorithms for permutation groups and graph isomorphism. In: 27th Symposium on Foundations of Computer Science, pp. 292\u2013302 (1986)","DOI":"10.1109\/SFCS.1986.39"},{"key":"22_CR33","doi-asserted-by":"crossref","unstructured":"Miller, G.: Isomorphism testing for graphs of bounded genus. In: Proceedings of 12th Annual ACM Symposium on Theory of Computing, pp. 225\u2013235. ACM (1980)","DOI":"10.1145\/800141.804670"},{"key":"22_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/978-3-642-35261-4_48","volume-title":"Algorithms and Computation","author":"Y Otachi","year":"2012","unstructured":"Otachi, Y.: Isomorphism for graphs of bounded connected-path-distance-width. In: Chao, K.-M., Hsu, T., Lee, D.-T. (eds.) ISAAC 2012. LNCS, vol. 7676, pp. 455\u2013464. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-35261-4_48"},{"key":"22_CR35","unstructured":"Stockhusen, C.: On the space and circuit complexity of parameterized problems. Ph.D. thesis, Dissertation, L\u00fcbeck, Universit\u00e4t zu L\u00fcbeck, 2017 (2017)"},{"issue":"2","key":"22_CR36","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 24(2), 105\u2013127 (1999)","journal-title":"Algorithmica"},{"key":"22_CR37","unstructured":"Zemlyachenko, V., Konieko, N., Tyshkevich, R.: Graph isomorphism problem (Russian). In: The Theory of Computation I, Notes Sci. Sem. LOMI 118 (1982)"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-75172-6_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T15:41:12Z","timestamp":1710344472000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-75172-6_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319751719","9783319751726"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-75172-6_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"31 January 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dhaka","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bangladesh","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 March 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 March 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cse.buet.ac.bd\/walcom2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}