{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:05:02Z","timestamp":1725555902389},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642130618"},{"type":"electronic","value":"9783642130625"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13062-5_21","type":"book-chapter","created":{"date-parts":[[2010,5,10]],"date-time":"2010-05-10T07:48:52Z","timestamp":1273477732000},"page":"220-231","source":"Crossref","is-referenced-by-count":17,"title":["A Framework for Path-Oriented Network Simplification"],"prefix":"10.1007","author":[{"given":"Hannu","family":"Toivonen","sequence":"first","affiliation":[]},{"given":"S\u00e9bastien","family":"Mahler","sequence":"additional","affiliation":[]},{"given":"Fang","family":"Zhou","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"Sevon, P., Eronen, L., Hintsanen, P., Kulovesi, K., Toivonen, H.: Link discovery in graphs derived from biologican databases. In: Leser, U., Naumann, F., Eckmann, B. (eds.) DILS 2006, Part I. LNCS (LNBI), vol.\u00a04705, pp. 35\u201349. Springer, Heidelberg (2006)","DOI":"10.1007\/11799511_5"},{"key":"21_CR2","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 Mining and Knowledge Discovery\u00a017, 3\u201323 (2008)","journal-title":"Data Mining and Knowledge Discovery"},{"key":"21_CR3","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/978-3-540-68125-0_3","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"M.R. Berthold","year":"2008","unstructured":"Berthold, M.R., Dill, F., K\u00f6tter, T., Thiel, K.: Supporting creativity: Towards associative discovery of new insights. In: Washio, T., Suzuki, E., Ting, K.M., Inokuchi, A. (eds.) PAKDD 2008. LNCS (LNAI), vol.\u00a05012, pp. 14\u201325. Springer, Heidelberg (2008)"},{"issue":"1","key":"21_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/321992.321993","volume":"24","author":"D.B. Johnson","year":"1977","unstructured":"Johnson, D.B.: Efficient algorithms for shortest paths in sparse networks. Journal of the ACM\u00a024(1), 1\u201313 (1977)","journal-title":"Journal of the ACM"},{"key":"21_CR5","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., Brejova, B., Vinar, T.: Simplifying flow networks. In: Nielsen, M., Rovan, B. (eds.) MFCS 2000. LNCS, vol.\u00a01893, pp. 192\u2013201. Springer, Heidelberg (2000)"},{"key":"21_CR6","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/j.ipl.2005.11.002","volume":"97","author":"E. Misiolek","year":"2006","unstructured":"Misiolek, E., Chen, D.Z.: Two flow network simplification algorithms. Information Processing Letters\u00a097, 197\u2013202 (2006)","journal-title":"Information Processing Letters"},{"key":"21_CR7","doi-asserted-by":"crossref","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","DOI":"10.1016\/S0079-7421(08)60539-3"},{"key":"21_CR8","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"},{"issue":"4","key":"21_CR9","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":"21_CR10","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/0925-7721(92)90003-B","volume":"1","author":"R.C. Veltkamp","year":"1991","unstructured":"Veltkamp, R.C.: The gamma-neighborhood graph. Computational Geometry\u00a01, 227\u2013246 (1991)","journal-title":"Computational Geometry"},{"key":"21_CR11","doi-asserted-by":"publisher","first-page":"48","DOI":"10.2307\/2033241","volume":"7","author":"J.B. Kruskal","year":"1956","unstructured":"Kruskal, J.B.: On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematical Society\u00a07, 48\u201350 (1956)","journal-title":"Proceedings of the American Mathematical Society"},{"key":"21_CR12","first-page":"52","volume-title":"ALENEX","author":"V. Osipov","year":"2009","unstructured":"Osipov, V., Sanders, P., Singler, J.: The filter-kruskal minimum spanning tree algorithm. In: Finocchi, I., Hershberger, J. (eds.) ALENEX, pp. 52\u201361. SIAM, Philadelphia (2009)"},{"issue":"4","key":"21_CR13","doi-asserted-by":"publisher","first-page":"949","DOI":"10.1016\/j.ajhg.2008.02.013","volume":"82","author":"S. K\u00f6hler","year":"2008","unstructured":"K\u00f6hler, S., Bauer, S., Horn, D., Robinson, P.: Walking the interactome for prioritization of candidate disease genes. American Journal of Human Genetics\u00a082(4), 949\u2013958 (2008)","journal-title":"American Journal of Human Genetics"},{"issue":"2","key":"21_CR14","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1145\/321694.321699","volume":"19","author":"J. Edmonds","year":"1972","unstructured":"Edmonds, J., Karp, R.M.: Theoretical improvements in algorithmic efficiency for network flow problems. Journal of the Association for Computing Machinery\u00a019(2), 248\u2013264 (1972)","journal-title":"Journal of the Association for Computing Machinery"}],"container-title":["Lecture Notes in Computer Science","Advances in Intelligent Data Analysis IX"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13062-5_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:00:30Z","timestamp":1606186830000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13062-5_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642130618","9783642130625"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13062-5_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}