{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T23:09:23Z","timestamp":1725750563285},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319024318"},{"type":"electronic","value":"9783319024325"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-02432-5_26","type":"book-chapter","created":{"date-parts":[[2013,9,29]],"date-time":"2013-09-29T20:51:58Z","timestamp":1380487918000},"page":"230-242","source":"Crossref","is-referenced-by-count":3,"title":["Solving Graph Isomorphism Using Parameterized Matching"],"prefix":"10.1007","author":[{"given":"Juan","family":"Mendivelso","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sunghwan","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sameh","family":"Elnikety","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuxiong","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Seung-won","family":"Hwang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoan","family":"Pinz\u00f3n","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_CR1","doi-asserted-by":"crossref","unstructured":"Amir, A., Aumann, Y., Cole, R., Lewenstein, M., Porat, E.: Function matching: Algorithms, applications, and a lower bound. In: Proc. 30th International Colloquium on Automata, Languages and Programming (2003)","DOI":"10.1007\/3-540-45061-0_72"},{"issue":"3","key":"26_CR2","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/0020-0190(94)90086-8","volume":"49","author":"A. Amir","year":"1994","unstructured":"Amir, A., Farach, M., Muthukrishnan, S.: Alphabet dependence in parameterized matching. Information Processing Letters\u00a049(3), 111\u2013115 (1994)","journal-title":"Information Processing Letters"},{"issue":"9","key":"26_CR3","doi-asserted-by":"publisher","first-page":"1389","DOI":"10.1016\/j.dam.2006.11.017","volume":"156","author":"A. Apostolico","year":"2008","unstructured":"Apostolico, A., Giancarlo, R.: Periodicity and repetitions in parameterized strings. Discrete Applied Mathematics\u00a0156(9), 1389\u20131398 (2008)","journal-title":"Discrete Applied Mathematics"},{"key":"26_CR4","doi-asserted-by":"crossref","unstructured":"Baker, B.: A theory of parameterized pattern matching: algorithms and applications. In: Proc. 25th Annual Symposium on Theory of Computing (1993)","DOI":"10.1145\/167088.167115"},{"key":"26_CR5","unstructured":"Baker, B.: Parameterized pattern matching by Boyer-Moore-type algorithms. In: Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, p. 550. Society for Industrial and Applied Mathematics (1995)"},{"issue":"1","key":"26_CR6","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1006\/jcss.1996.0003","volume":"52","author":"B. Baker","year":"1996","unstructured":"Baker, B.: Parameterized pattern matching: algorithms and applications. J. Comput. Syst. Sci.\u00a052(1), 28\u201342 (1996)","journal-title":"J. Comput. Syst. Sci."},{"issue":"5","key":"26_CR7","doi-asserted-by":"publisher","first-page":"1343","DOI":"10.1137\/S0097539793246707","volume":"26","author":"B. Baker","year":"1997","unstructured":"Baker, B.: Parameterized duplication in strings: algorithms and an application to softwaremaintenance. SIAM Journal on Computing\u00a026(5), 1343\u20131362 (1997)","journal-title":"SIAM Journal on Computing"},{"issue":"03","key":"26_CR8","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1142\/S0218001404003228","volume":"18","author":"D. Conte","year":"2004","unstructured":"Conte, D., Foggia, P., Sansone, C., Vento, M.: Thirty years of graph matching in pattern recognition. International Journal of Pattern Recognition and Artificial Intelligence\u00a018(03), 265\u2013298 (2004)","journal-title":"International Journal of Pattern Recognition and Artificial Intelligence"},{"issue":"10","key":"26_CR9","doi-asserted-by":"publisher","first-page":"1367","DOI":"10.1109\/TPAMI.2004.75","volume":"26","author":"L.P. Cordella","year":"2004","unstructured":"Cordella, L.P., Foggia, P., Sansone, C., Vento, M.: A (sub) graph isomorphism algorithm for matching large graphs. IEEE Transactions on Pattern Analysis and Machine Intelligence\u00a026(10), 1367\u20131372 (2004)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"issue":"2","key":"26_CR10","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1016\/j.datak.2007.03.005","volume":"63","author":"C. Mouza Du","year":"2007","unstructured":"Du Mouza, C., Rigaux, P., Scholl, M.: Parameterized pattern queries. Data & Knowledge Engineering\u00a063(2), 433\u2013456 (2007)","journal-title":"Data & Knowledge Engineering"},{"issue":"1","key":"26_CR11","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/BF01580113","volume":"5","author":"J. Edmonds","year":"1973","unstructured":"Edmonds, J., Johnson, E.L.: Matching, euler tours and the chinese postman. Mathematical Programming\u00a05(1), 88\u2013124 (1973)","journal-title":"Mathematical Programming"},{"issue":"3","key":"26_CR12","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.ipl.2006.06.009","volume":"100","author":"K. Fredriksson","year":"2006","unstructured":"Fredriksson, K., Mozgovoy, M.: Efficient parameterized string matching. Information Processing Letters\u00a0100(3), 91\u201396 (2006)","journal-title":"Information Processing Letters"},{"key":"26_CR13","doi-asserted-by":"crossref","unstructured":"Hazay, C.: Parameterized matching. Master\u2019s thesis, Bar-Ilan University (2004)","DOI":"10.1007\/978-3-540-30140-0_38"},{"issue":"3","key":"26_CR14","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1145\/1273340.1273345","volume":"3","author":"C. Hazay","year":"2007","unstructured":"Hazay, C., Lewenstein, M., Sokol, D.: Approximate parameterized matching. ACM Transactions on Algorithms\u00a03(3), 29 (2007)","journal-title":"ACM Transactions on Algorithms"},{"key":"26_CR15","doi-asserted-by":"crossref","unstructured":"Hazay, C., Lewenstein, M., Tsur, D.: Two dimensional parameterized matching. In: CPM, pp. 266\u2013279 (2005)","DOI":"10.1007\/11496656_23"},{"key":"26_CR16","volume-title":"Proceedings of the 36th Annual Symposium on Foundations of Computer Science","author":"S. Kosaraju","year":"1995","unstructured":"Kosaraju, S.: Faster algorithms for the construction of parameterized suffix trees. In: Proceedings of the 36th Annual Symposium on Foundations of Computer Science. IEEE Computer Society Press, Washington, DC (1995)"},{"key":"26_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/978-3-540-89097-3_23","volume-title":"String Processing and Information Retrieval","author":"I. Lee","year":"2008","unstructured":"Lee, I., Mendivelso, J., Pinz\u00f3n, Y.J.: \u03b4\u03b3 \u2013 parameterized matching. In: Amir, A., Turpin, A., Moffat, A. (eds.) SPIRE 2008. LNCS, vol.\u00a05280, pp. 236\u2013248. Springer, Heidelberg (2008)"},{"key":"26_CR18","doi-asserted-by":"crossref","unstructured":"Lewenstein, M.: Parameterized matching. In: Encyclopedia of Algorithms. Springer (2008)","DOI":"10.1007\/978-0-387-30162-4_282"},{"key":"26_CR19","first-page":"45","volume":"30","author":"B.D. McKay","year":"1981","unstructured":"McKay, B.D.: Practical graph isomorphism. Congressus Numerantium\u00a030, 45 (1981)","journal-title":"Congressus Numerantium"},{"key":"26_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/978-3-642-34109-0_37","volume-title":"String Processing and Information Retrieval","author":"J. Mendivelso","year":"2012","unstructured":"Mendivelso, J., Lee, I., Pinz\u00f3n, Y.J.: Approximate function matching under \u03b4- and \u03b3- distances. In: Calder\u00f3n-Benavides, L., Gonz\u00e1lez-Caro, C., Ch\u00e1vez, E., Ziviani, N. (eds.) SPIRE 2012. LNCS, vol.\u00a07608, pp. 348\u2013359. Springer, Heidelberg (2012)"},{"key":"26_CR21","doi-asserted-by":"crossref","unstructured":"Salmela, L., Tarhio, J.: Sublinear algorithms for parameterized matching. In: Proc. 17th Annual Symposium on Combinatorial Pattern Matching (2006)","DOI":"10.1007\/11780441_32"},{"issue":"1","key":"26_CR22","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/321921.321925","volume":"23","author":"J.R. Ullmann","year":"1976","unstructured":"Ullmann, J.R.: An algorithm for subgraph isomorphism. Journal of the ACM (JACM)\u00a023(1), 31\u201342 (1976)","journal-title":"Journal of the ACM (JACM)"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-02432-5_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T12:29:23Z","timestamp":1558096163000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-02432-5_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319024318","9783319024325"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-02432-5_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}