{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T08:21:14Z","timestamp":1743063674917,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030002558"},{"type":"electronic","value":"9783030002565"}],"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-030-00256-5_22","type":"book-chapter","created":{"date-parts":[[2018,9,1]],"date-time":"2018-09-01T08:22:08Z","timestamp":1535790128000},"page":"266-278","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On Weak Isomorphism of Rooted Vertex-Colored Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4856-5863","authenticated-orcid":false,"given":"Lars","family":"Jaffke","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7798-7446","authenticated-orcid":false,"given":"Mateus","family":"de Oliveira Oliveira","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,9,2]]},"reference":[{"key":"22_CR1","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/s00453-013-9787-y","volume":"71","author":"V Arvind","year":"2015","unstructured":"Arvind, V., Das, B., K\u00f6bler, J., Toda, S.: Colored hypergraph isomorphism is fixed parameter tractable. Algorithmica 71, 120\u2013138 (2015)","journal-title":"Algorithmica"},{"key":"22_CR2","doi-asserted-by":"crossref","unstructured":"Babai, L.: Graph isomorphism in quasipolynomial time [extended abstract]. In: STOC, pp. 684\u2013697. ACM (2016)","DOI":"10.1145\/2897518.2897542"},{"key":"22_CR3","doi-asserted-by":"crossref","unstructured":"Babai, L., Grigoryev, D.Y., Mount, D.M.: Isomorphism of graphs with bounded eigenvalue multiplicity. In: STOC, pp. 310\u2013324. ACM (1982)","DOI":"10.1145\/800070.802206"},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"Babai, L., Kantor, W.M., Luks, E.M.: Computational complexity and the classification of finite simple groups. In: FOCS, pp. 162\u2013171. IEEE (1983)","DOI":"10.1109\/SFCS.1983.10"},{"key":"22_CR5","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.tcs.2011.11.029","volume":"447","author":"B Bollig","year":"2012","unstructured":"Bollig, B.: On symbolic obdd-based algorithms for the minimum spanning tree problem. Theor. Comput. Sci. 447, 2\u201312 (2012)","journal-title":"Theor. Comput. Sci."},{"key":"22_CR6","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/j.dam.2016.05.028","volume":"214","author":"B Bollig","year":"2016","unstructured":"Bollig, B., Bury, M.: On the OBDD representation of some graph classes. Discret. Appl. Math. 214, 34\u201353 (2016)","journal-title":"Discret. Appl. Math."},{"key":"22_CR7","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/j.ic.2014.08.006","volume":"239","author":"B Bollig","year":"2014","unstructured":"Bollig, B., Pr\u00f6ger, T.: On efficient implicit obdd-based algorithms for maximal matchings. Inf. Comput. 239, 29\u201343 (2014)","journal-title":"Inf. Comput."},{"key":"22_CR8","unstructured":"Booth, K.S., Colbourn, C.J.: Problems polynomially equivalent to graph isomorphism. Computer Science Department, Univ. Waterloo (1979)"},{"issue":"6","key":"22_CR9","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1006\/eujc.1999.0381","volume":"21","author":"V Chepoi","year":"2000","unstructured":"Chepoi, V., Dragan, F.: A note on distance approximating trees in graphs. Eur. J. Combin. 21(6), 761\u2013766 (2000)","journal-title":"Eur. J. Combin."},{"key":"22_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-5559-1","volume-title":"Fundamentals of Paramterized Complexity","author":"RG Downey","year":"2013","unstructured":"Downey, R.G., Fellows, M.R.: Fundamentals of Paramterized Complexity. Springer, London (2013). https:\/\/doi.org\/10.1007\/978-1-4471-5559-1"},{"key":"22_CR11","doi-asserted-by":"crossref","unstructured":"Furst, M., Hopcroft, J., Luks, E.: Polynomial-time algorithms for permutation groups. In: FOCS, pp. 36\u201341. IEEE (1980)","DOI":"10.1109\/SFCS.1980.34"},{"issue":"5","key":"22_CR12","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1145\/2371656.2371662","volume":"59","author":"M Grohe","year":"2012","unstructured":"Grohe, M.: Fixed-point definability and polynomial time on graphs with excluded minors. J. ACM 59(5), 27 (2012)","journal-title":"J. ACM"},{"issue":"1","key":"22_CR13","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1137\/120892234","volume":"44","author":"M Grohe","year":"2015","unstructured":"Grohe, M., Marx, D.: Structure theorem and isomorphism test for graphs with excluded topological subgraphs. SIAM J. Comp. 44(1), 114\u2013159 (2015)","journal-title":"SIAM J. Comp."},{"key":"22_CR14","doi-asserted-by":"crossref","unstructured":"Grohe, M., Schweitzer, P.: Isomorphism testing for graphs of bounded rank width. In: FOCS, pp. 1010\u20131029. IEEE (2015)","DOI":"10.1109\/FOCS.2015.66"},{"key":"22_CR15","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_CR16","doi-asserted-by":"crossref","unstructured":"Lokshtanov, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Fixed-parameter tractable canonization and isomorphism test for graphs of bounded treewidth. In: FOCS, pp. 186\u2013195. IEEE (2014)","DOI":"10.1109\/FOCS.2014.28"},{"issue":"1","key":"22_CR17","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_CR18","doi-asserted-by":"crossref","unstructured":"Miller, G.: Isomorphism testing for graphs of bounded genus. In: STOC, pp. 225\u2013235. ACM (1980)","DOI":"10.1145\/800141.804670"},{"key":"22_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1132","DOI":"10.1007\/11602613_112","volume-title":"Algorithms and Computation","author":"R Nunkesser","year":"2005","unstructured":"Nunkesser, R., Woelfel, P.: Representation of graphs by OBDDs. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol. 3827, pp. 1132\u20131142. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11602613_112"},{"key":"22_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/978-3-540-30559-0_13","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"D Sawitzki","year":"2004","unstructured":"Sawitzki, D.: A symbolic approach to the all-pairs shortest-paths problem. In: Hromkovi\u010d, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, vol. 3353, pp. 154\u2013167. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30559-0_13"},{"key":"22_CR21","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546549","volume-title":"Permutation Group Algorithms","author":"A Seress","year":"2003","unstructured":"Seress, A.: Permutation Group Algorithms. Cambridge University Press, Cambridge (2003)"},{"key":"22_CR22","doi-asserted-by":"crossref","unstructured":"Sims, C.C.: Computational methods in the study of permutation groups. In: Computational Problems in Abstract Algebra, pp. 169\u2013183 (1970)","DOI":"10.1016\/B978-0-08-012975-4.50020-5"},{"issue":"1","key":"22_CR23","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.jda.2005.01.008","volume":"4","author":"P Woelfel","year":"2006","unstructured":"Woelfel, P.: Symbolic topological sorting with OBDDs. J. Discret. Algorithms 4(1), 51\u201371 (2006)","journal-title":"J. Discret. Algorithms"},{"issue":"2","key":"22_CR24","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"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-00256-5_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T13:26:15Z","timestamp":1710336375000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-00256-5_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030002558","9783030002565"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-00256-5_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":"2 September 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Graph-Theoretic Concepts in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cottbus","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","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":"27 June 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"44","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.wg2018.b-tu.de\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"66","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"45% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"11,5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}