{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:36:41Z","timestamp":1725568601233},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642167195"},{"type":"electronic","value":"9783642167201"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-16720-1_1","type":"book-chapter","created":{"date-parts":[[2010,11,2]],"date-time":"2010-11-02T09:40:14Z","timestamp":1288690814000},"page":"1-12","source":"Crossref","is-referenced-by-count":3,"title":["Mining Graphs with Constraints on Symmetry and Diameter"],"prefix":"10.1007","author":[{"given":"Natalia","family":"Vanetik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Arnborg, S., Proskurowski, A.: Linear time algorithms for NP-hard problems restricted to partial k-trees. Discrete Applied Mathematics\u00a023(1), 11\u201324 (1989); 51\u201358 (2002)","DOI":"10.1016\/0166-218X(89)90031-0"},{"issue":"2","key":"1_CR2","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1016\/0196-6774(87)90039-3","volume":"8","author":"M. Bern","year":"1987","unstructured":"Bern, M., Lawler, E., Wong, A.: Linear-time computation of optimal subgraphs of decomposable graphs. Journal of Algorithms\u00a08(2), 216\u2013235 (1987)","journal-title":"Journal of Algorithms"},{"key":"1_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/3-540-19488-6_110","volume-title":"Automata, Languages and Programming","author":"H.L. Bodlaender","year":"1988","unstructured":"Bodlaender, H.L.: Dynamic programming on graphs with bounded treewidth. In: Lepist\u00f6, T., Salomaa, A. (eds.) ICALP 1988. LNCS, vol.\u00a0317, pp. 105\u2013118. Springer, Heidelberg (1988)"},{"issue":"6","key":"1_CR4","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1137\/S0097539793251219","volume":"25","author":"H.L. Bodlaender","year":"1996","unstructured":"Bodlaender, H.L.: A linear time algorithm for finding tree-decompositions of small treewidth. SIAM Journal on Computing\u00a025(6), 1305\u20131317 (1996)","journal-title":"SIAM Journal on Computing"},{"key":"1_CR5","volume-title":"Proc. IEEE Conf. on Systems, Man and Cybernetics (SMC 2004)","author":"C. Borgelt","year":"2004","unstructured":"Borgelt, C., Meinl, T., Berthold, M.: Advanced pruning strategies to speed up closed molecular fragments. In: Proc. IEEE Conf. on Systems, Man and Cybernetics (SMC 2004), The Hague, Netherlands. IEEE Press, Piscataway (2004)"},{"key":"1_CR6","volume-title":"Proceedings of the 3rd IEEE International Conference on Data Mining","author":"Y. Chi","year":"2003","unstructured":"Chi, Y., Yang, Y., Muntz, R.R.: Indexing and mining free trees. In: Xindong Wu, A.T. (ed.) Proceedings of the 3rd IEEE International Conference on Data Mining. IEEE Computer Society, Los Alamitos (November 2003)"},{"issue":"3","key":"1_CR7","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/S0020-0190(99)00054-X","volume":"70","author":"Y. Dinitz","year":"1999","unstructured":"Dinitz, Y., Itai, A., Rodeh, M.: On an Algorithm of Zemlyachenko for Subtree Isomorphism. Inf. Process. Lett.\u00a070(3), 141\u2013146 (1999)","journal-title":"Inf. Process. Lett."},{"key":"1_CR8","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/3-540-45372-5_2","volume-title":"Principles of Data Mining and Knowledge Discovery","author":"A. Inokuchi","year":"2000","unstructured":"Inokuchi, A., Washio, T., Motoda, H.: An apriori-based algorithm for mining frequent substructures from graph data. In: Zighed, D.A., Komorowski, J., \u017bytkow, J.M. (eds.) PKDD 2000. LNCS (LNAI), vol.\u00a01910, pp. 13\u201323. Springer, Heidelberg (2000)"},{"key":"1_CR9","unstructured":"Jahn, K., Kramer, S.: Optimizing gSpan for Molecular Datasets. In: Proceedings of the Third International Workshop on Mining Graphs, Trees and Sequences 2005, vol.\u00a013(5), pp. 509\u2013523 (2002)"},{"key":"1_CR10","unstructured":"Optimized gSpan algorithm for molecular databases implementation, http:\/\/wwwkramer.in.tum.de\/research\/pubs\/jahn_mgts05"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Kuramochi, M., Karypis, G.: Frequent subgraph discovery. In: Proceedings of the 2001 IEEE International Conference on Data Mining, pp. 313\u2013320 (2001)","DOI":"10.1109\/ICDM.2001.989534"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"MacArthur, B.D., Snchez-Garca, R.J., Anderson, J.W.: Symmetry in complex networks. Discrete Applied Mathematics 156(18), 3525\u20133531","DOI":"10.1016\/j.dam.2008.04.008"},{"key":"1_CR13","unstructured":"LibTW tree decomposition SW library, http:\/\/www.treewidth.com"},{"key":"1_CR14","unstructured":"Lin, X., Liu, C., Zhang, Y., Zhou, X.: Efficiently Computing Frequent Tree-Like Topology Patterns in a Web Environment. In: Proceedings of 31st Int. Conf. on Tech. of Object-Oriented Language and Systems (1998)"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Robertson, N., Seymour, P.D.: Graph minors III: Planar tree-width. Journal of Combinatorial Theory, Series B 36, 49\u201364","DOI":"10.1016\/0095-8956(84)90013-3"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Rckert, U., Kramer, S.: Frequent Free Tree Discovery in Graph Data. In: Proceedings of the ACM Symposium on Applied Computing, pp. 564\u2013570 (2004)","DOI":"10.1145\/967900.968018"},{"key":"1_CR17","first-page":"270","volume-title":"Proc. 16th Int. Joint Conf. on Artificial Intelligence, IJCAI 1999","author":"A. Srinivasan","year":"1999","unstructured":"Srinivasan, A., King, R.D., Bristol, D.W.: An assessment of submissions made to the Predictive Toxicology Evaluation Challenge. In: Proc. 16th Int. Joint Conf. on Artificial Intelligence, IJCAI 1999, Stockholm, Sweden, pp. 270\u2013275. Morgan Kaufmann, San Francisco (1999)"},{"key":"1_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-3-540-31849-1_14","volume-title":"Web Technologies Research and Development - APWeb 2005","author":"C. Wang","year":"2005","unstructured":"Wang, C., Zhu, Y., Wu, T., Wang, W., Shi, B.: Constraint-Based Graph Mining in Large Database. In: Zhang, Y., Tanaka, K., Yu, J.X., Wang, S., Li, M. (eds.) APWeb 2005. LNCS, vol.\u00a03399, pp. 133\u2013144. Springer, Heidelberg (2005)"},{"key":"1_CR19","doi-asserted-by":"publisher","first-page":"2611","DOI":"10.1016\/j.physa.2008.01.027","volume":"387","author":"Y. Xiao","year":"2008","unstructured":"Xiao, Y., Wu, W., Wang, H., Xiong, M., Wang, W.: Symmetry-based Structure Entropy of Complex Networks. Physica A\u00a0387, 2611\u20132619 (2008)","journal-title":"Physica A"},{"key":"1_CR20","unstructured":"Yan, X., Han, J.: gSpan: Graph-Based Substructure Pattern Mining. In: ICDM 2002, pp. 721\u2013724 (2002)"},{"key":"1_CR21","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1145\/956750.956784","volume-title":"Proc. 9th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining (KDD 2003)","author":"X. Yan","year":"2003","unstructured":"Yan, X., Han, J.: Closegraph, Mining closed frequent graph patterns. In: Proc. 9th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining (KDD 2003), Washington DC, USA, pp. 286\u2013295. ACM Press, New York (2003)"},{"key":"1_CR22","doi-asserted-by":"crossref","unstructured":"Zaki, M.J.: Efficiently mining frequent trees in a forest. In: Proceedings of the 8th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM Press, New York (2002)","DOI":"10.1145\/775047.775058"},{"key":"1_CR23","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1007\/978-3-540-71701-0_38","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"F. Zhu","year":"2007","unstructured":"Zhu, F., Yan, X., Han, J., Yu, P.S.: gPrune: A Constraint Pushing Framework for Graph Pattern Mining. In: Zhou, Z.-H., Li, H., Yang, Q. (eds.) PAKDD 2007. LNCS (LNAI), vol.\u00a04426, pp. 388\u2013400. Springer, Heidelberg (2007)"}],"container-title":["Lecture Notes in Computer Science","Web-Age Information Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16720-1_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,5]],"date-time":"2019-06-05T21:04:24Z","timestamp":1559768664000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16720-1_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642167195","9783642167201"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16720-1_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}