{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T22:55:33Z","timestamp":1762210533793},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,7,9]],"date-time":"2008-07-09T00:00:00Z","timestamp":1215561600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2008,8]]},"DOI":"10.1007\/s10618-008-0106-1","type":"journal-article","created":{"date-parts":[[2008,7,8]],"date-time":"2008-07-08T15:54:49Z","timestamp":1215532489000},"page":"3-23","source":"Crossref","is-referenced-by-count":61,"title":["Finding reliable subgraphs from large probabilistic graphs"],"prefix":"10.1007","volume":"17","author":[{"given":"Petteri","family":"Hintsanen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hannu","family":"Toivonen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,7,9]]},"reference":[{"key":"106_CR1","unstructured":"Birnbaum ZW (1969) On the importance of different components in a multicomponent system. Multivar Anal II:581\u2013592"},{"key":"106_CR2","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"35","author":"RE Bryant","year":"1986","unstructured":"Bryant RE (1986) Graph-based algorithms for boolean function manipulation. IEEE Trans Comput 35: 677\u2013691","journal-title":"IEEE Trans Comput"},{"key":"106_CR3","volume-title":"The combinatorics of network reliability","author":"CJ Colbourn","year":"1987","unstructured":"Colbourn CJ (1987) The combinatorics of network reliability. Oxford University Press, Oxford"},{"key":"106_CR4","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/s10994-007-5030-x","volume":"70","author":"L De Raedt","year":"2008","unstructured":"De Raedt L, Kersting K, Kimmig A, Revoredo K, Toivonen H (2008) Compressing probabilistic Prolog programs. Mach Learn 70: 151\u2013168","journal-title":"Mach Learn"},{"key":"106_CR5","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/0022-247X(65)90125-3","volume":"10","author":"RJ Duffin","year":"1965","unstructured":"Duffin RJ (1965) Topology of series\u2013parallel networks. J Math Anal Appl 10: 303\u2013318","journal-title":"J Math Anal Appl"},{"key":"106_CR6","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1137\/S0097539795290477","volume":"28","author":"D Eppstein","year":"1998","unstructured":"Eppstein D (1998) Finding the k shortest paths. SIAM J Comput 28: 652\u2013673","journal-title":"SIAM J Comput"},{"key":"106_CR7","doi-asserted-by":"crossref","unstructured":"Faloutsos C, McCurley KS, Tomkins A (2004) Fast discovery of connection subgraphs. In: Proceedings of the 10th ACM SIGKDD international conference on knowledge discovery and data mining, pp 118\u2013127","DOI":"10.1145\/1014052.1014068"},{"key":"106_CR8","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1145\/1290672.1290682","volume":"3","author":"J Hershberger","year":"2007","unstructured":"Hershberger J, Maxel M, Suri S (2007) Finding the k shortest simple paths: a new algorithm and its implementation. ACM Trans Algorithms 3: 45","journal-title":"ACM Trans Algorithms"},{"key":"106_CR9","doi-asserted-by":"crossref","unstructured":"Hintsanen P (2007) The most reliable subgraph problem. In: Proceedings of the 11th European conference on principles and practice of knowledge discovery in databases, pp 471\u2013478","DOI":"10.1007\/978-3-540-74976-9_48"},{"key":"106_CR10","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1287\/mnsc.18.7.401","volume":"18","author":"EL Lawler","year":"1972","unstructured":"Lawler EL (1972) A procedure for computing the k best solutions to discrete optimization problems and its application to the shortest path problem. Manage Sci 18: 401\u2013405","journal-title":"Manage Sci"},{"key":"106_CR11","unstructured":"Roditty L (2007) On the k-simple shortest paths problem in weighted directed graphs. In: Proceedings of the 18th annual ACM-SIAM symposium on discrete algorithms, pp 920\u2013928"},{"key":"106_CR12","doi-asserted-by":"crossref","unstructured":"Sevon P, Eronen L, Hintsanen P, Kulovesi K, Toivonen H (2006) Link discovery in graphs derived from biological databases. In: Proceedings of data integration in the life sciences. Third international workshop, pp 35\u201349","DOI":"10.1007\/11799511_5"},{"key":"106_CR13","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1137\/0211023","volume":"11","author":"J Valdes","year":"1982","unstructured":"Valdes J, Tarjan RE, Lawler EL (1982) The recognition of series\u2013parallel digraphs. SIAM J Comput 11: 298\u2013313","journal-title":"SIAM J Comput"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-008-0106-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10618-008-0106-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-008-0106-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T15:29:40Z","timestamp":1559230180000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10618-008-0106-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,7,9]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2008,8]]}},"alternative-id":["106"],"URL":"https:\/\/doi.org\/10.1007\/s10618-008-0106-1","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"value":"1384-5810","type":"print"},{"value":"1573-756X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,7,9]]}}}