{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,30]],"date-time":"2025-05-30T08:10:01Z","timestamp":1748592601634,"version":"3.41.0"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319232034"},{"type":"electronic","value":"9783319232041"}],"license":[{"start":{"date-parts":[[2015,8,29]],"date-time":"2015-08-29T00:00:00Z","timestamp":1440806400000},"content-version":"tdm","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":[[2016]]},"DOI":"10.1007\/978-3-319-23204-1_19","type":"book-chapter","created":{"date-parts":[[2015,8,28]],"date-time":"2015-08-28T15:12:25Z","timestamp":1440774745000},"page":"189-197","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Graph Representative Structure for Detecting Automorphic Graphs"],"prefix":"10.1007","author":[{"given":"Yu Wai","family":"Hlaing","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kyaw May","family":"Oo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,8,29]]},"reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"Borgelt, C., Berthold, M.R.: Mining molecular fragments: finding relevant substructures of molecues. In: ICDM, pp. 51\u201358 (2002)","DOI":"10.1109\/ICDM.2002.1183885"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Huan, J., Wang, W., Bandyopadhyay, D., Snoeyink, J., Prins, J., Tropsha, A.: Mining protein family specific residue packing patterns from protein structure graphs. In: Proceedings of the 8th Annual International Conference on Research in Computational Molecular Biology (RECOMB), pp. 308\u2013315 (2004)","DOI":"10.1145\/974614.974655"},{"issue":"12","key":"19_CR3","doi-asserted-by":"publisher","first-page":"1979","DOI":"10.1016\/S0031-3203(98)90142-X","volume":"32","author":"BT Messmer","year":"1991","unstructured":"Messmer, B.T., Bunke, H.: A Decision Tree Approach to Graph and Subgraph Isomorphism Detection. Pattern Recoginition 32(12), 1979\u20131998 (1991)","journal-title":"Pattern Recoginition"},{"key":"19_CR4","unstructured":"Raghavan, S., Garcia-Molina, H.: Representing web graphs. In: Proceeding of IEEE International Conference on Data Engineering (2003)"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Srikant, R.: Mining sequential patterns. In: Proceeding of the 11th International Conference on Data Engineering (ICDE), pp 3\u201314. IEEE Press (1995)","DOI":"10.1109\/ICDE.1995.380415"},{"key":"19_CR6","unstructured":"Agrawal, R., srikant, R.: Fast algorithms for mining associations rules. In: Proceeding of 20th International Conference on Very Large Databases (VLDB), pp. 487\u2013499, September 1994"},{"key":"19_CR7","unstructured":"Chen, C.W.K., Yun, D.Y.Y.: Unifying graph-matching problem with a practical solution. In: Proceeding of International Conference on Systems, Signals, Control, Computers, September 1998"},{"key":"19_CR8","unstructured":"Chittimoori, R.N., Holder, L.B., Cook, D.J.: Applying the SUBDUE structure discovery system to the chemical toxicity domain. In: Proceeding of the 12th International Florida AI Research Society Conference, pp. 90\u201394 (1999)"},{"key":"19_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph Theory With Applications","author":"JA Bondy","year":"1976","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory With Applications. Elsevier Science Publishing Co. Inc., New York (1976)"},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"Kuramochi, M., Karypis, G.: An efficient algorithm for discoverying frequent subgraphs. In: Proc. 2001 International Conference on Data Mining (ICDM 2001), San Jose, CA, pp. 313\u2013320, November 2001","DOI":"10.1109\/ICDM.2001.989534"},{"key":"19_CR11","unstructured":"Fortin, S.: The graph isomorphism problem. Technical Report TR 96-20, Department of Computing Science, University of Alberta (1996)"},{"key":"19_CR12","unstructured":"Vijayalakshmi, R., Nadarajan, R., Nirmala, P., Thilaga, M.: A Novel Approach for Detection and Elimination of Automorphic Graphs in Graph Database. Int. J. Open Problems Compt. Math. 3(1), March 2010"}],"container-title":["Advances in Intelligent Systems and Computing","Genetic and Evolutionary Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-23204-1_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,30]],"date-time":"2025-05-30T07:34:27Z","timestamp":1748590467000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-23204-1_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,8,29]]},"ISBN":["9783319232034","9783319232041"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-23204-1_19","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2015,8,29]]},"assertion":[{"value":"29 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}