{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,29]],"date-time":"2025-05-29T04:11:18Z","timestamp":1748491878276,"version":"3.41.0"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319213972"},{"type":"electronic","value":"9783319213989"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-21398-9_1","type":"book-chapter","created":{"date-parts":[[2015,6,23]],"date-time":"2015-06-23T15:12:41Z","timestamp":1435072361000},"page":"3-15","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Mining Preserving Structures in a Graph Sequence"],"prefix":"10.1007","author":[{"given":"Takeaki","family":"Uno","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yushi","family":"Uno","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,24]]},"reference":[{"key":"1_CR1","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/978-3-540-75488-6_6","volume-title":"Discovery Science","author":"H Arimura","year":"2007","unstructured":"Arimura, H., Uno, T., Shimozono, S.: Time and space efficient discovery of maximal geometric graphs. In: Corruble, V., Takeda, M., Suzuki, E. (eds.) DS 2007. LNCS (LNAI), vol. 4755, pp. 42\u201355. Springer, Heidelberg (2007)"},{"key":"1_CR2","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0166-218X(95)00026-N","volume":"65","author":"D Avis","year":"1996","unstructured":"Avis, D., Fukuda, K.: Reverse search for enumeration. Discr. Appl. Math. 65, 21\u201346 (1996)","journal-title":"Discr. Appl. Math."},{"key":"1_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-3-642-04180-8_25","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"M Berlingerio","year":"2009","unstructured":"Berlingerio, M., Bonchi, F., Bringmann, B., Gionis, A.: Mining graph evolution rules. In: Buntine, W., Grobelnik, M., Mladeni\u0107, D., Shawe-Taylor, J. (eds.) ECML PKDD 2009, Part I. LNCS, vol. 5781, pp. 115\u2013130. Springer, Heidelberg (2009)"},{"key":"1_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/978-3-642-40104-6_19","volume-title":"Algorithms and Data Structures","author":"K Buchin","year":"2013","unstructured":"Buchin, K., Buchin, M., van Kreveld, M., Speckmann, B., Staals, F.: Trajectory grouping structure. In: Dehne, F., Solis-Oba, R., Sack, J.-R. (eds.) WADS 2013. LNCS, vol. 8037, pp. 219\u2013230. Springer, Heidelberg (2013)"},{"key":"1_CR5","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1142\/S0129054103001728","volume":"14","author":"BB Xuan","year":"2003","unstructured":"Xuan, B.B., Ferreira, A., Jarry, A.: Computing shortest, fastest, and foremost journeys in dynamic networks. Int. J. of Foundations of Computer Science 14, 267\u2013285 (2003)","journal-title":"Int. J. of Foundations of Computer Science"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Borgwardt, K.M., Kriegel, H.P., Wackersreuther, P.: Pattern mining in frequent dynamic subgraphs. In: Proc. 6th IEEE ICDM, pp. 818\u2013822 (2006)","DOI":"10.1109\/ICDM.2006.124"},{"key":"1_CR7","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1145\/265910.265914","volume":"44","author":"D Eppstein","year":"1997","unstructured":"Eppstein, D., Galil, Z., Italiano, G.F., Nissenzweig, A.: Sparsification\u2013A technique for speeding up dynamic graph algorithms. J. ACM 44, 669\u2013696 (1997)","journal-title":"J. ACM"},{"key":"1_CR8","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/0893-9659(94)90045-0","volume":"7","author":"K Fukuda","year":"1994","unstructured":"Fukuda, K., Matsui, T.: Finding all the perfect matchings in bipartite graphs. Applied Mathematics Letters 7, 15\u201318 (1994)","journal-title":"Applied Mathematics Letters"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Han, J., Dong, G., Yin, Y.: Efficient mining of partial periodic patterns in time series database. In: Proc. 15th IEEE ICDE, pp. 106\u2013115 (1999)","DOI":"10.1109\/ICDE.1999.754913"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Inokuchi A., Washio, T.: A fast method to mine frequent subsequences from graph sequence data. In: Proc. 8th IEEE ICDM, pp. 303\u2013312 (2008)","DOI":"10.1109\/ICDM.2008.106"},{"key":"1_CR11","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1023\/A:1021726221443","volume":"50","author":"Mining graph data","year":"2003","unstructured":"Mining graph data: A. Inokuchi T. Washio and H. Motoda. Complete mining of frequent patterns from graphs. Machine Learning 50, 321\u2013354 (2003)","journal-title":"Machine Learning"},{"key":"1_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/11535331_21","volume-title":"Advances in Spatial and Temporal Databases","author":"P Kalnis","year":"2005","unstructured":"Kalnis, P., Mamoulis, N., Bakiras, S.: On discovering moving clusters in spatio-temporal data. In: Medeiros, C.B., Egenhofer, M., Bertino, E. (eds.) SSTD 2005. LNCS, vol. 3633, pp. 364\u2013381. Springer, Heidelberg (2005)"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Lahiri, M. Berger-Wolf, T.Y.: Mining periodic behavior in dynamic social networks. In: Proc. 8th IEEE ICDM, pp. 373\u2013382 (2008)","DOI":"10.1109\/ICDM.2008.104"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Li, Z., Ding, B., Han, J., Kays, R.: Swarm: Mining relaxed temporal moving object clusters. In: Proc. 36th Int\u2019l Conf. on VLDB, pp. 723\u2013734 (2010)","DOI":"10.14778\/1920841.1920934"},{"key":"1_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-540-27810-8_23","volume-title":"Algorithm Theory - SWAT 2004","author":"K Makino","year":"2004","unstructured":"Makino, K., Uno, T.: New algorithms for enumerating all maximal cliques. In: Hagerup, T., Katajainen, J. (eds.) SWAT 2004. LNCS, vol. 3111, pp. 260\u2013272. Springer, Heidelberg (2004)"},{"key":"1_CR16","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/S0306-4379(99)00003-4","volume":"24","author":"N Pasquier","year":"1999","unstructured":"Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Efficient mining of association rules using closed itemset lattices. J. Information Systems 24, 25\u201346 (1999)","journal-title":"J. Information Systems"},{"key":"1_CR17","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1002\/net.1975.5.3.237","volume":"5","author":"RC Read","year":"1975","unstructured":"Read, R.C., Tarjan, R.E.: Bounds on backtrack algorithms for listing cycles, paths, and spanning trees. Networks 5, 237\u2013252 (1975)","journal-title":"Networks"},{"key":"1_CR18","doi-asserted-by":"crossref","unstructured":"Sun, J., Faloutsos, C., Papadimitriou, S., Yu, P.S.: GraphScope: Parameter-free mining of large time-evolving graphs. In: Proc. 13th ACM Int\u2019l Conf. on KDD, pp. 687\u2013696 (2007)","DOI":"10.1145\/1281192.1281266"},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"Tantipathananandh, C., Berger-Wolf, T.: Constant-factor approximation algorithms for identifying dynamic communities. In: Proc. 15th ACM Int\u2019l Conf. on KDD, pp. 827\u2013836 (2009)","DOI":"10.1145\/1557019.1557110"},{"key":"1_CR20","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.tcs.2006.06.015","volume":"363","author":"E Tomita","year":"2006","unstructured":"Tomita, E., Tanaka, A., Takahashi, H.: The worst-case time complexity for generating all maximal cliques and computational experiments. Theor. Comp. Sci. 363, 28\u201342 (2006)","journal-title":"Theor. Comp. Sci."},{"key":"1_CR21","doi-asserted-by":"publisher","first-page":"1998","DOI":"10.1093\/ietisy\/e90-d.12.1998","volume":"E90\u2013D","author":"Y Uno","year":"2007","unstructured":"Uno, Y., Ota, Y., Uemichi, A.: Web structure mining by isolated cliques. IEICE Transactions on Information and Systems E90\u2013D, 1998\u20132006 (2007)","journal-title":"IEICE Transactions on Information and Systems"},{"key":"1_CR22","unstructured":"Yan, X., Han, J.: GSPAN: graph-based substructure pattern mining. In: Proc. 2nd IEEE ICDM, pp. 721\u2013724 (2002)"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21398-9_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T20:33:53Z","timestamp":1748464433000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21398-9_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319213972","9783319213989"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21398-9_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"24 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}