{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T07:27:23Z","timestamp":1758266843017,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642202438"},{"type":"electronic","value":"9783642202445"}],"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-20244-5_6","type":"book-chapter","created":{"date-parts":[[2011,4,12]],"date-time":"2011-04-12T08:14:17Z","timestamp":1302596057000},"page":"53-64","source":"Crossref","is-referenced-by-count":3,"title":["Classifying Graphs Using Theoretical Metrics: A Study of Feasibility"],"prefix":"10.1007","author":[{"given":"Linhong","family":"Zhu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wee Keong","family":"Ng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuguo","family":"Han","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","first-page":"253","volume-title":"Proceedings of the 1989 ACM International Conference on Management of Data","author":"R. Agrawal","year":"1989","unstructured":"Agrawal, R., Borgida, A., Jagadish, H.V.: Efficient management of transitive relationships in large data and knowledge bases. In: Proceedings of the 1989 ACM International Conference on Management of Data, pp. 253\u2013262. ACM, New York (1989)"},{"key":"6_CR2","first-page":"171","volume-title":"Proceedings of the 15th Annual ACM Symposium on Theory of Computing","author":"L. Babai","year":"1983","unstructured":"Babai, L., Luks, E.M.: Canonical labeling of graphs. In: Proceedings of the 15th Annual ACM Symposium on Theory of Computing, pp. 171\u2013183. ACM, New York (1983)"},{"issue":"9","key":"6_CR3","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(9), 689\u2013694 (1997)","journal-title":"Pattern Recognition Letters"},{"key":"6_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"961","DOI":"10.1007\/11687238_56","volume-title":"Advances in Database Technology - EDBT 2006","author":"J. Cheng","year":"2006","unstructured":"Cheng, J., Yu, J.X., Lin, X., Wang, H., Yu, P.S.: Fast computation of reachability labeling for large graphs. In: Ioannidis, Y., Scholl, M.H., Schmidt, J.W., Matthes, F., Hatzopoulos, M., B\u00f6hm, K., Kemper, A., Grust, T., B\u00f6hm, C. (eds.) EDBT 2006. LNCS, vol.\u00a03896, pp. 961\u2013979. Springer, Heidelberg (2006)"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Coffman, T.R., Marcus, S.E.: Dynamic classification of groups through social network analysis and hmms. In: IEEE Aerospace Conference, pp. 3197\u20133205 (2004)","DOI":"10.1109\/AERO.2004.1368125"},{"issue":"8","key":"6_CR6","doi-asserted-by":"publisher","first-page":"1036","DOI":"10.1109\/TKDE.2005.127","volume":"17","author":"M. Deshpande","year":"2005","unstructured":"Deshpande, M., Kuramochi, M., Wale, N., Karypis, G.: Frequent substructure-based approaches for classifying chemical compounds. IEEE Transaction on Knowledge and Data Engineering\u00a017(8), 1036\u20131050 (2005)","journal-title":"IEEE Transaction on Knowledge and Data Engineering"},{"key":"6_CR7","volume-title":"Graph Theory","author":"R. Diestel","year":"2005","unstructured":"Diestel, R.: Graph Theory, 3rd edn., vol.\u00a0173. Springer, Heidelberg (2005)","edition":"3"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Faloutsos, M., Yang, Q., Siganos, G., Lonardi, S.: Evolution versus intelligent design: comparing the topology of protein-protein interaction networks to the internet. In: Proceedings of the LSS Computational Systems Bioinformatics Conference, Stanford, CA, pp. 299\u2013310 (2006)","DOI":"10.1142\/9781860947575_0036"},{"key":"6_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/3-540-44469-6_29","volume-title":"Database and Expert Systems Applications","author":"M. Montes-y-G\u00f3mez","year":"2000","unstructured":"Montes-y-G\u00f3mez, M., L\u00f3pez-L\u00f3pez, A., Gelbukh, A.: Information retrieval with conceptual graph matching. In: Ibrahim, M., K\u00fcng, J., Revell, N. (eds.) DEXA 2000. LNCS, vol.\u00a01873, pp. 312\u2013321. Springer, Heidelberg (2000)"},{"key":"6_CR10","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1145\/1645953.1646027","volume-title":"Proceeding of the 18th ACM Conference on Information and Knowledge Management","author":"N. Jin","year":"2009","unstructured":"Jin, N., Young, C., Wang, W.: Graph classification based on pattern co-occurrence. In: Proceeding of the 18th ACM Conference on Information and Knowledge Management, pp. 573\u2013582. ACM, New York (2009)"},{"key":"6_CR11","first-page":"879","volume-title":"Proceedings of the 2010 International Conference on Management of Data","author":"N. Jin","year":"2010","unstructured":"Jin, N., Young, C., Wang, W.: Gaia: graph classification using evolutionary computation. In: Proceedings of the 2010 International Conference on Management of Data, pp. 879\u2013890. ACM, New York (2010)"},{"key":"6_CR12","first-page":"793","volume-title":"Proceedings of the 16th ACM International Conference on Knowledge Discovery and Data Mining","author":"X. Kong","year":"2010","unstructured":"Kong, X., Yu, P.S.: Semi-supervised feature selection for graph classification. In: Proceedings of the 16th ACM International Conference on Knowledge Discovery and Data Mining, pp. 793\u2013802. ACM, New York (2010)"},{"issue":"2","key":"6_CR13","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/BF02289146","volume":"14","author":"R. Luce","year":"1949","unstructured":"Luce, R., Perry, A.: A method of matrix analysis of group structure. Psychometrika\u00a014(2), 95\u2013116 (1949)","journal-title":"Psychometrika"},{"key":"6_CR14","first-page":"60","volume":"2","author":"S. Milgram","year":"1967","unstructured":"Milgram, S.: The Small World Problem. Psychology Today\u00a02, 60\u201367 (1967)","journal-title":"Psychology Today"},{"key":"6_CR15","doi-asserted-by":"publisher","first-page":"844","DOI":"10.1109\/ICDE.2009.133","volume-title":"Proceedings of the 2009 IEEE International Conference on Data Engineering","author":"S. Ranu","year":"2009","unstructured":"Ranu, S., Singh, A.K.: Graphsig: A scalable approach to mining significant subgraphs in large graph databases. In: Proceedings of the 2009 IEEE International Conference on Data Engineering, pp. 844\u2013855. IEEE Computer Society, Washington, DC, USA (2009)"},{"key":"6_CR16","first-page":"578","volume-title":"Proceeding of the 14th ACM International Conference on Knowledge Discovery and Data Mining","author":"H. Saigo","year":"2008","unstructured":"Saigo, H., Kr\u00e4mer, N., Tsuda, K.: Partial least squares regression for graph mining. In: Proceeding of the 14th ACM International Conference on Knowledge Discovery and Data Mining, pp. 578\u2013586. ACM, New York (2008)"},{"key":"6_CR17","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/0378-8733(83)90028-X","volume":"5","author":"S.B. Seidman","year":"1983","unstructured":"Seidman, S.B.: Network structure and minimum degre. Social Networks\u00a05, 269\u2013287 (1983)","journal-title":"Social Networks"},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"Tao, Y., Papadias, D., Lian, X.: Reverse knn search in arbitrary dimensionality. In: Proceedings of the 30th International Conference on Very Large Data Bases, pp. 744\u2013755. Very Large Data Bases Endowment (2004)","DOI":"10.1016\/B978-012088469-8.50066-8"},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"Thoma, M., Cheng, H., Gretton, A., Han, J., Peter Kriegel, H., Smola, A., Song, L., Yu, P.S., Yan, X., Borgwardt, K.: Near-optimal supervised feature selection among frequent subgraphs. In: SIAM Int\u2019l Conf. on Data Mining (2009)","DOI":"10.1137\/1.9781611972795.92"},{"key":"6_CR20","doi-asserted-by":"crossref","unstructured":"Thomason, B.E., Coffman, T.R., Marcus, S.E.: Sensitivity of social network analysis metrics to observation noise. In: IEEE Aerospace Conference, pp. 3206\u20133216 (2004)","DOI":"10.1109\/AERO.2004.1368126"},{"key":"6_CR21","unstructured":"University of Michigan: The origin of power-laws in internet topologies revisited. Web page, http:\/\/topology.eecs.umich.edu\/data.html"},{"key":"6_CR22","first-page":"75","volume-title":"Proceedings of the 22nd International Conference on Data Engineering","author":"H. Wang","year":"2006","unstructured":"Wang, H., He, H., Yang, J., Yu, P.S., Yu, J.X.: Dual labeling: Answering graph reachability queries in constant time. In: Proceedings of the 22nd International Conference on Data Engineering, p. 75. IEEE Computer Society, Washington, DC, USA (2006)"},{"key":"6_CR23","first-page":"433","volume-title":"Proceedings of the 2008 ACM International Conference on Management of Data","author":"X. Yan","year":"2008","unstructured":"Yan, X., Cheng, H., Han, J., Yu, P.S.: Mining significant graph patterns by leap search. In: Proceedings of the 2008 ACM International Conference on Management of Data, pp. 433\u2013444. ACM, New York (2008)"},{"key":"6_CR24","doi-asserted-by":"publisher","first-page":"25","DOI":"10.14778\/1687627.1687631","volume":"2","author":"Z. Zeng","year":"2009","unstructured":"Zeng, Z., Tung, A.K.H., Wang, J., Feng, J., Zhou, L.: Comparing stars: on approximating graph edit distance. Proc. VLDB Endow.\u00a02, 25\u201336 (2009)","journal-title":"Proc. VLDB Endow."}],"container-title":["Lecture Notes in Computer Science","Database Systems for Adanced Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20244-5_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,5]],"date-time":"2025-03-05T00:50:51Z","timestamp":1741135851000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20244-5_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642202438","9783642202445"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20244-5_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}