{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:24:43Z","timestamp":1759638283230},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642237188"},{"type":"electronic","value":"9783642237195"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-23719-5_32","type":"book-chapter","created":{"date-parts":[[2011,8,30]],"date-time":"2011-08-30T13:14:33Z","timestamp":1314710073000},"page":"370-381","source":"Crossref","is-referenced-by-count":4,"title":["Isomorphism of (mis)Labeled Graphs"],"prefix":"10.1007","author":[{"given":"Pascal","family":"Schweitzer","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"32_CR1","doi-asserted-by":"crossref","unstructured":"Borgs, C., Chayes, J.T., Lov\u00e1sz, L., S\u00f3s, V.T., Szegedy, B., Vesztergombi, K.: Graph limits and parameter testing. In: STOC 2006, New York, pp. 261\u2013270 (2006)","DOI":"10.1145\/1132516.1132556"},{"issue":"8","key":"32_CR2","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1016\/S0167-8655(97)00060-3","volume":"18","author":"H. Bunke","year":"1997","unstructured":"Bunke, H.: On a relation between graph edit distance and maximum common subgraph. Pattern Recognition Letters\u00a018(8), 689\u2013694 (1997)","journal-title":"Pattern Recognition Letters"},{"issue":"9","key":"32_CR3","doi-asserted-by":"publisher","first-page":"917","DOI":"10.1109\/34.790431","volume":"21","author":"H. Bunke","year":"1999","unstructured":"Bunke, H.: Error correcting graph matching: on the influence of the underlying cost function. Pattern Analysis and Machine Intelligence\u00a021(9), 917\u2013922 (1999)","journal-title":"Pattern Analysis and Machine Intelligence"},{"issue":"1","key":"32_CR4","doi-asserted-by":"crossref","first-page":"87","DOI":"10.21136\/CPM.1985.118225","volume":"110","author":"G. Chartrand","year":"1985","unstructured":"Chartrand, G., Saba, F., Zou, H.-B.: Edge rotations and distance between graphs. \u010casopis P\u011bst. Mat.\u00a0110(1), 87\u201391 (1985)","journal-title":"\u010casopis P\u011bst. Mat."},{"key":"32_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/11821069_21","volume-title":"Mathematical Foundations of Computer Science 2006","author":"J. Chen","year":"2006","unstructured":"Chen, J., Kanj, I.A., Xia, G.: Improved parameterized upper bounds for vertex cover. In: Kr\u00e1lovi\u010d, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol.\u00a04162, pp. 238\u2013249. Springer, Heidelberg (2006)"},{"key":"32_CR6","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139086547","volume-title":"Eigenspaces of Graphs","author":"D.M. Cvetkovi\u0107","year":"1997","unstructured":"Cvetkovi\u0107, D.M., Rowlinson, P., Simi\u0107, S.: Eigenspaces of Graphs. Cambridge University Press, Cambridge (1997)"},{"key":"32_CR7","first-page":"63","volume":"4","author":"J. D\u00e9nes","year":"1959","unstructured":"D\u00e9nes, J.: The representation of a permutation as the product of a minimal number of transpositions, and its connection with the theory of graphs. Magyar Tud. Akad. Mat. Kutat\u00f3 Int. K\u00f6zl.\u00a04, 63\u201371 (1959)","journal-title":"Magyar Tud. Akad. Mat. Kutat\u00f3 Int. K\u00f6zl."},{"key":"32_CR8","series-title":"Monographs in Computer Science","volume-title":"Parameterized Complexity","author":"R.G. Downey","year":"1998","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Monographs in Computer Science. Springer, London (1998)"},{"issue":"3","key":"32_CR9","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/s004930050059","volume":"19","author":"S. Evdokimov","year":"1999","unstructured":"Evdokimov, S., Ponomarenko, I.N.: Isomorphism of coloured graphs with slowly increasing multiplicity of Jordan blocks. Combinatorica\u00a019(3), 321\u2013333 (1999)","journal-title":"Combinatorica"},{"key":"32_CR10","doi-asserted-by":"crossref","unstructured":"Filotti, I.S., Mayer, J.N.: A polynomial-time algorithm for determining the isomorphism of graphs of fixed genus. In: STOC 1980, pp. 236\u2013243 (1980)","DOI":"10.1145\/800141.804671"},{"key":"32_CR11","series-title":"Texts in Theoretical Computer Science. An EATCS Series","volume-title":"Parameterized Complexity Theory","author":"J. Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Texts in Theoretical Computer Science. An EATCS Series. Springer, London (2006)"},{"key":"32_CR12","doi-asserted-by":"crossref","unstructured":"Furst, M.L., Hopcroft, J.E., Luks, E.M.: Polynomial-time algorithms for permutation groups. In: FOCS 1980, Washington, USA, pp. 36\u201341 (1980)","DOI":"10.1109\/SFCS.1980.34"},{"key":"32_CR13","unstructured":"Johnson, M.: An ordering of some metrics defined on the space of graphs. Czechoslovak Math. J. 37(112), 75\u201385 (1987)"},{"key":"32_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0333-9","volume-title":"The graph isomorphism problem: its structural complexity","author":"J. K\u00f6bler","year":"1993","unstructured":"K\u00f6bler, J., Sch\u00f6ning, U., Tor\u00e1n, J.: The graph isomorphism problem: its structural complexity. Birkh\u00e4user Verlag, Basel (1993)"},{"key":"32_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.\u00a06139, pp. 81\u201392. Springer, Heidelberg (2010)"},{"issue":"1","key":"32_CR16","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/0022-0000(82)90009-5","volume":"25","author":"E.M. Luks","year":"1982","unstructured":"Luks, E.M.: Isomorphism of graphs of bounded valence can be tested in polynomial time. Journal of Computer and System Sciences\u00a025(1), 42\u201365 (1982)","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"32_CR17","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1080\/00207168908803766","volume":"30","author":"D. Marcu","year":"1989","unstructured":"Marcu, D.: Note on the edge rotation distance between trees. International Journal of Computer Mathematics\u00a030(1), 13\u201315 (1989)","journal-title":"International Journal of Computer Mathematics"},{"key":"32_CR18","doi-asserted-by":"crossref","unstructured":"Miller, G.L.: Isomorphism testing for graphs of bounded genus. In: STOC 1980, New York, pp. 225\u2013235 (1980)","DOI":"10.1145\/800141.804670"},{"key":"32_CR19","unstructured":"Schweitzer, P.: Problems of unknown complexity: graph isomorphism and Ramsey theoretic numbers. Phd thesis, Universit\u00e4t des Saarlandes, Saarbr\u00fccken (2009)"},{"issue":"9","key":"32_CR20","doi-asserted-by":"publisher","first-page":"2833","DOI":"10.1016\/j.patcog.2008.03.011","volume":"41","author":"R.C. Wilson","year":"2008","unstructured":"Wilson, R.C., Zhu, P.: A study of graph spectra for comparing graphs and trees. Pattern Recognition\u00a041(9), 2833\u20132841 (2008)","journal-title":"Pattern Recognition"},{"issue":"2","key":"32_CR21","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"},{"issue":"4","key":"32_CR22","doi-asserted-by":"crossref","first-page":"371","DOI":"10.21136\/CPM.1975.117890","volume":"100","author":"B. Zelinka","year":"1975","unstructured":"Zelinka, B.: On a certain distance between isomorphism classes of graphs. \u010casopis P\u011bst. Mat.\u00a0100(4), 371\u2013373 (1975)","journal-title":"\u010casopis P\u011bst. Mat."},{"issue":"2","key":"32_CR23","doi-asserted-by":"crossref","first-page":"211","DOI":"10.21136\/CPM.1990.108363","volume":"115","author":"B. Zelinka","year":"1990","unstructured":"Zelinka, B.: Contraction distance between isomorphism classes of graphs. \u010casopis P\u011bst. Mat.\u00a0115(2), 211\u2013216 (1990)","journal-title":"\u010casopis P\u011bst. Mat."},{"issue":"4","key":"32_CR24","doi-asserted-by":"crossref","first-page":"1426","DOI":"10.1007\/BF02104746","volume":"29","author":"V.N. Zemlyachenko","year":"1985","unstructured":"Zemlyachenko, V.N., Korneenko, N.M., Tyshkevich, R.I.: Graph isomorphism problem. Journal of Mathematical Sciences\u00a029(4), 1426\u20131481 (1985)","journal-title":"Journal of Mathematical Sciences"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23719-5_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,10]],"date-time":"2024-04-10T18:30:42Z","timestamp":1712773842000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23719-5_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642237188","9783642237195"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23719-5_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}