{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T12:19:10Z","timestamp":1767183550080,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642318290"},{"type":"electronic","value":"9783642318306"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-31830-6_13","type":"book-chapter","created":{"date-parts":[[2012,6,27]],"date-time":"2012-06-27T10:02:38Z","timestamp":1340791358000},"page":"179-198","source":"Crossref","is-referenced-by-count":28,"title":["Simplification of Networks by Edge Pruning"],"prefix":"10.1007","author":[{"given":"Fang","family":"Zhou","sequence":"first","affiliation":[]},{"given":"S\u00e9bastien","family":"Mahler","sequence":"additional","affiliation":[]},{"given":"Hannu","family":"Toivonen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Zhou, F., Mahler, S., Toivonen, H.: Network Simplification with Minimal Loss of Connectivity. In: The 10th IEEE International Conference on Data Mining (ICDM), Sydney, Australia, pp. 659\u2013668 (2010)","DOI":"10.1109\/ICDM.2010.133"},{"key":"13_CR2","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/978-3-642-31830-6_2","volume-title":"Bisociative Knowledge Discovery","author":"W. Dubitzky","year":"2012","unstructured":"Dubitzky, W., K\u00f6tter, T., Schmidt, O., Berthold, M.R.: Towards Creative Information Exploration Based on Koestler\u2019s Concept of Bisociation. In: Berthold, M.R. (ed.) Bisociative Knowledge Discovery. LNCS (LNAI), vol.\u00a07250, pp. 11\u201332. Springer, Heidelberg (2012)"},{"key":"13_CR3","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/978-3-642-31830-6_12","volume-title":"Bisociative Knowledge Discovery","author":"F. Zhou","year":"2012","unstructured":"Zhou, F., Mahler, S., Toivonen, H.: Review of BisoNet Abstraction Techniques. In: Berthold, M.R. (ed.) Bisociative Knowledge Discovery. LNCS (LNAI), vol.\u00a07250, pp. 166\u2013178. Springer, Heidelberg (2012)"},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/978-3-642-13062-5_21","volume-title":"Advances in Intelligent Data Analysis IX","author":"H. Toivonen","year":"2010","unstructured":"Toivonen, H., Mahler, S., Zhou, F.: A Framework for Path-Oriented Network Simplification. In: Cohen, P.R., Adams, N.M., Berthold, M.R. (eds.) IDA 2010. LNCS, vol.\u00a06065, pp. 220\u2013231. Springer, Heidelberg (2010)"},{"key":"13_CR5","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/11799511_5","volume-title":"Data Integration in the Life Sciences","author":"P. Sevon","year":"2006","unstructured":"Sevon, P., Eronen, L., Hintsanen, P., Kulovesi, K., Toivonen, H.: Link Discovery in Graphs Derived from Biological Databases. In: Leser, U., Naumann, F., Eckman, B. (eds.) DILS 2006. LNCS (LNBI), vol.\u00a04075, pp. 35\u201349. Springer, Heidelberg (2006)"},{"issue":"1","key":"13_CR6","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","volume":"7","author":"J. Kruskal Jr.","year":"1956","unstructured":"Kruskal Jr., J.: On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematical society\u00a07(1), 48\u201350 (1956)","journal-title":"Proceedings of the American Mathematical society"},{"key":"13_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/3-540-44612-5_15","volume-title":"Mathematical Foundations of Computer Science 2000","author":"T.C. Biedl","year":"2000","unstructured":"Biedl, T.C., Brejov\u00e1, B., Vina\u0159, T.: Simplifying Flow Networks. In: Nielsen, M., Rovan, B. (eds.) MFCS 2000. LNCS, vol.\u00a01893, pp. 192\u2013201. Springer, Heidelberg (2000)"},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"737","DOI":"10.1007\/11533719_75","volume-title":"Computing and Combinatorics","author":"E. Misio\u0142ek","year":"2005","unstructured":"Misio\u0142ek, E., Chen, D.Z.: Efficient Algorithms for Simplifying Flow Networks. In: Wang, L. (ed.) COCOON 2005. LNCS, vol.\u00a03595, pp. 737\u2013746. Springer, Heidelberg (2005)"},{"key":"13_CR9","first-page":"249","volume-title":"The Psychology of Learning and Motivation: Advances in Research and Theory","author":"R. Schvaneveldt","year":"1989","unstructured":"Schvaneveldt, R., Durso, F., Dearholt, D.: Network structures in proximity data. In: The Psychology of Learning and Motivation: Advances in Research and Theory, vol.\u00a024, pp. 249\u2013284. Academic Press, New York (1989)"},{"key":"13_CR10","doi-asserted-by":"publisher","first-page":"1611","DOI":"10.1016\/j.ipm.2007.09.005","volume":"44","author":"A. Quirin","year":"2008","unstructured":"Quirin, A., Cordon, O., Santamaria, J., Vargas-Quesada, B., Moya-Anegon, F.: A new variant of the Pathfinder algorithm to generate large visual science maps in cubic time. Information Processing and Management\u00a044, 1611\u20131623 (2008)","journal-title":"Information Processing and Management"},{"key":"13_CR11","doi-asserted-by":"publisher","first-page":"812","DOI":"10.1109\/ICDM.2009.142","volume-title":"Proceedings of the 2009 Ninth IEEE International Conference on Data Mining, ICDM 2009","author":"S. Hauguel","year":"2009","unstructured":"Hauguel, S., Zhai, C., Han, J.: Parallel PathFinder Algorithms for Mining Structures from Graphs. In: Proceedings of the 2009 Ninth IEEE International Conference on Data Mining, ICDM 2009, pp. 812\u2013817. IEEE Computer Society, Washington, DC (2009)"},{"issue":"4","key":"13_CR12","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/0031-3203(80)90066-7","volume":"12","author":"G.T. Toussaint","year":"1980","unstructured":"Toussaint, G.T.: The Relative Neighbourhood Graph of a Finite Planar Set. Pattern Recognition\u00a012(4), 261\u2013268 (1980)","journal-title":"Pattern Recognition"},{"key":"13_CR13","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1137\/1.9781611972894.5","volume-title":"2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX)","author":"Vitaly Osipov","year":"2009","unstructured":"Osipov, V., Sanders, P., Singler, J.: The Filter-Kruskal Minimum Spanning Tree Algorithm. In: ALENEX, pp. 52\u201361. SIAM (2009)"},{"issue":"12","key":"13_CR14","doi-asserted-by":"publisher","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"M. Girvan","year":"2002","unstructured":"Girvan, M., Newman, M.E.J.: Community structure in social and biological networks. Proc. Natl. Acad. Sci. U S A\u00a099(12), 7821\u20137826 (2002)","journal-title":"Proc. Natl. Acad. Sci. U S A"},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"Birnbaum, Z.W.: On the importance of different components in a multicomponent system. In: Multivariate Analysis - II, pp. 581\u2013592 (1969)","DOI":"10.21236\/AD0670563"},{"key":"13_CR16","first-page":"617","volume-title":"Handbooks in Operations Research and Management Science","author":"M. Gr\u00f6tschel","year":"1995","unstructured":"Gr\u00f6tschel, M., Monma, C.L., Stoer, M.: Design of Survivable Networks. In: Handbooks in Operations Research and Management Science, vol.\u00a07, pp. 617\u2013672 (1995)"},{"key":"13_CR17","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1145\/1014052.1014068","volume-title":"KDD 2004: Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","author":"C. Faloutsos","year":"2004","unstructured":"Faloutsos, C., McCurley, K.S., Tomkins, A.: Fast Discovery of Connection Subgraphs. In: KDD 2004: Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 118\u2013127. ACM, New York (2004)"},{"key":"13_CR18","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10618-008-0106-1","volume":"17","author":"P. Hintsanen","year":"2008","unstructured":"Hintsanen, P., Toivonen, H.: Finding reliable subgraphs from large probabilistic graphs. Data Min. Knowl. Discov.\u00a017, 3\u201323 (2008)","journal-title":"Data Min. Knowl. Discov."},{"key":"13_CR19","doi-asserted-by":"crossref","unstructured":"Toivonen, H., Zhou, F., Hartikainen, A., Hinkka, A.: Compression of Weighted Graphs. In: The 17th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD), San Diego, CA, USA (2011)","DOI":"10.1145\/2020408.2020566"}],"container-title":["Lecture Notes in Computer Science","Bisociative Knowledge Discovery"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31830-6_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,30]],"date-time":"2019-06-30T05:22:24Z","timestamp":1561872144000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31830-6_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642318290","9783642318306"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31830-6_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}