{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T04:07:32Z","timestamp":1746072452291,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642371851"},{"type":"electronic","value":"9783642371868"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-37186-8_2","type":"book-chapter","created":{"date-parts":[[2013,4,10]],"date-time":"2013-04-10T03:01:39Z","timestamp":1365562899000},"page":"29-44","source":"Crossref","is-referenced-by-count":0,"title":["Mining Graphs of Prescribed Connectivity"],"prefix":"10.1007","author":[{"given":"Natalia","family":"Vanetik","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1002\/net.1975.5.3.253","volume":"5","author":"R.E. Bixby","year":"1975","unstructured":"Bixby, R.E.: The minimum number of edges and vertices in a graph with edge connectivity n and m n-bonds. Networks\u00a05, 253\u2013298 (1975)","journal-title":"Networks"},{"key":"2_CR2","unstructured":"De Vitis, A.: The cactus representation of all minimum cuts in a weighted graph. Technical Report 454, IASI-CNR (1997)"},{"key":"2_CR3","first-page":"290","volume-title":"Studies in Discrete Optimization","author":"E.A. Dinits","year":"1976","unstructured":"Dinits, E.A., Karzanov, A.V., Lomonosov, M.V.: On the structure of a family of minimal weighted cuts in a graph. In: Fridman, A.A. (ed.) Studies in Discrete Optimization, pp. 290\u2013306. Nauka, Moscow (1976)"},{"key":"2_CR4","unstructured":"Fiedler, M., Borgelt, C.: Support computation for mining frequent subgraphs in a single graph. In: International Workshop on Mining and Learning with Graphs (2007)"},{"key":"2_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/3-540-69346-7_23","volume-title":"Integer Programming and Combinatorial Optimization","author":"L. Fleischer","year":"1998","unstructured":"Fleischer, L.: Building Chain and Cactus Representations of All Minimum Cuts from Hao-Orlin in the Same Asymptotic Run Time. In: Bixby, R.E., Boyd, E.A., R\u00edos-Mercado, R.Z. (eds.) IPCO 1998. LNCS, vol.\u00a01412, pp. 294\u2013309. Springer, Heidelberg (1998)"},{"issue":"4","key":"2_CR6","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1137\/0109047","volume":"9","author":"R.E. Gomory","year":"1991","unstructured":"Gomory, R.E., Hu, T.C.: Multi-terminal network flows. J. Soc. Indust. Appl. Math.\u00a09(4), 551\u2013570 (1991)","journal-title":"J. Soc. Indust. Appl. Math."},{"issue":"31-33","key":"2_CR7","doi-asserted-by":"publisher","first-page":"2784","DOI":"10.1016\/j.tcs.2010.03.030","volume":"411","author":"T. Horv\u00e1th","year":"2010","unstructured":"Horv\u00e1th, T., Ramon, J.: Efficient frequent connected subgraph mining in graphs of bounded tree-width. Theor. Comput. Sci.\u00a0411(31-33), 2784\u20132797 (2010)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"2_CR8","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1145\/234533.234534","volume":"43","author":"D.R. Karger","year":"1996","unstructured":"Karger, D.R., Stein, C.: A new approach to the minimum cut problem. Journal of the ACM\u00a043(4), 601\u2013640 (1996)","journal-title":"Journal of the ACM"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Karger, D.R., Panigrahi, D.: A near-linear time algorithm for constructing a cactus representation of minimum cuts. In: SODA 2009, pp. 246\u2013255 (2009)","DOI":"10.1137\/1.9781611973068.28"},{"key":"2_CR10","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/BF01074775","volume":"22","author":"A.V. Karzanov","year":"1986","unstructured":"Karzanov, A.V., Timofeev, E.A.: Efficient algorithms for finding all minimal edge cuts of a nonoriented graph. Cybernetics\u00a022, 156\u2013162 (1986); Translated from Kibernetika 2, 8\u201312 (1986)","journal-title":"Cybernetics"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Kuramochi, M., Karypis, G.: Frequent Subgraph Discovery. In: ICDM 2001, pp. 313\u2013320 (2001)","DOI":"10.1109\/ICDM.2001.989534"},{"key":"2_CR12","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/BF03167227","volume":"11","author":"H. Nagamochi","year":"1994","unstructured":"Nagamochi, H., Kameda, T.: Canonical cactus representation for minimum cuts. Japan Journal of Industrial Appliel Mathematics\u00a011, 343\u2013361 (1994)","journal-title":"Japan Journal of Industrial Appliel Mathematics"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Papadopoulos, A., Lyritsis, A., Manolopoulos, Y.: Skygraph: an algorithm for important subgraph discovery in relational graphs. Journal of Data Mining and Knowledge Discovery\u00a017(1) (2008)","DOI":"10.1007\/s10618-008-0109-y"},{"key":"2_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-3-642-15939-8_14","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"M. Seeland","year":"2010","unstructured":"Seeland, M., Girschick, T., Buchwald, F., Kramer, S.: Online Structural Graph Clustering Using Frequent Subgraph Mining. In: Balc\u00e1zar, J.L., Bonchi, F., Gionis, A., Sebag, M. (eds.) ECML PKDD 2010, Part III. LNCS, vol.\u00a06323, pp. 213\u2013228. Springer, Heidelberg (2010)"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Yan, X., Zhou, X.J., Han, J.: Mining Closed Relational Graphs with Connectivity Constraints. In: ICDE 2005, pp. 357\u2013358 (2005)","DOI":"10.1145\/1081870.1081908"},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"Zhang, S., Li, S., Yang, J.: GADDI: distance index based subgraph matching in biological networks. In: EDBT 2009, pp. 192\u2013203 (2009)","DOI":"10.1145\/1516360.1516384"}],"container-title":["Communications in Computer and Information Science","Knowledge Discovery, Knowledge Engineering and Knowledge Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-37186-8_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T03:54:40Z","timestamp":1745985280000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-37186-8_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642371851","9783642371868"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-37186-8_2","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2013]]}}}