{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,15]],"date-time":"2026-02-15T21:12:13Z","timestamp":1771189933573,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540749752","type":"print"},{"value":"9783540749769","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74976-9_48","type":"book-chapter","created":{"date-parts":[[2007,8,29]],"date-time":"2007-08-29T06:52:35Z","timestamp":1188370355000},"page":"471-478","source":"Crossref","is-referenced-by-count":16,"title":["The Most Reliable Subgraph Problem"],"prefix":"10.1007","author":[{"given":"Petteri","family":"Hintsanen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"48_CR1","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1145\/1014052.1014068","volume-title":"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: Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 118\u2013127. ACM Press, New York (2004)"},{"key":"48_CR2","first-page":"171","volume-title":"Proceedings of the Third IEEE International Conference on Data Mining","author":"S. Lin","year":"2003","unstructured":"Lin, S., Chalupsky, H.: Unsupervised link discovery in multi-relational data via rarity analysis. In: Proceedings of the Third IEEE International Conference on Data Mining, pp. 171\u2013178. IEEE Computer Society Press, Los Alamitos (2003)"},{"key":"48_CR3","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1145\/1117454.1117462","volume":"7","author":"C. Ramakrishnan","year":"2005","unstructured":"Ramakrishnan, C., Milnor, W.H., Perry, M., Sheth, A.P.: Discovering informative connection subgraphs in multi-relational graphs. SIGKDD Explorations\u00a07, 56\u201363 (2005)","journal-title":"SIGKDD Explorations"},{"key":"48_CR4","doi-asserted-by":"publisher","first-page":"1170","DOI":"10.1101\/gr.2203804","volume":"14","author":"S. Asthana","year":"2004","unstructured":"Asthana, S., King, O.D., Gibbons, F.D., Roth, F.P.: Predicting protein complex membership using probabilistic network reliability. Genome Research\u00a014, 1170\u20131175 (2004)","journal-title":"Genome Research"},{"key":"48_CR5","doi-asserted-by":"crossref","unstructured":"Sevon, P., Eronen, L., Hintsanen, P., Kulovesi, K., Toivonen, H.: Link discovery in graphs derived from biological databases. In: Proceedings of Data Integration in the Life Sciences, Third International Workshop, pp. 35\u201349 (2006)","DOI":"10.1007\/11799511_5"},{"key":"48_CR6","unstructured":"De Raedt, L., Kersting, K., Kimmig, A., Revoredo, K., Toivonen, H.: Compressing probabilistic Prolog programs (submitted)"},{"key":"48_CR7","volume-title":"The Combinatorics of Network Reliability","author":"C.J. Colbourn","year":"1987","unstructured":"Colbourn, C.J.: The Combinatorics of Network Reliability. Oxford University Press, Oxford (1987)"},{"key":"48_CR8","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":"48_CR9","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1109\/24.210266","volume":"42","author":"J. Hong","year":"1993","unstructured":"Hong, J., Lie, C.: Joint reliability-importance of two edges in an undirected network. IEEE Transactions on Reliability\u00a042, 17\u201333 (1993)","journal-title":"IEEE Transactions on Reliability"},{"key":"48_CR10","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1109\/24.285108","volume":"43","author":"L.B. Page","year":"1994","unstructured":"Page, L.B., Perry, J.E.: Reliability polynomials and link importance in networks. IEEE Transactions on Reliability\u00a043, 51\u201358 (1994)","journal-title":"IEEE Transactions on Reliability"},{"key":"48_CR11","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1137\/0208032","volume":"8","author":"L.G. Valiant","year":"1979","unstructured":"Valiant, L.G.: The complexity of enumeration and reliability problems. SIAM Journal on Computing\u00a08, 410\u2013421 (1979)","journal-title":"SIAM Journal on Computing"},{"key":"48_CR12","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company (1979)"},{"key":"48_CR13","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1002\/net.3230100206","volume":"10","author":"M.O. Ball","year":"1980","unstructured":"Ball, M.O.: Complexity of network reliability computations. Networks\u00a010, 153\u2013165 (1980)","journal-title":"Networks"},{"key":"48_CR14","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1137\/0211023","volume":"11","author":"J. Valdes","year":"1982","unstructured":"Valdes, J., Tarjan, R.E., Lawler, E.L.: The recognition of series-parallel digraphs. SIAM Journal on Computing\u00a011, 298\u2013313 (1982)","journal-title":"SIAM Journal on Computing"},{"key":"48_CR15","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1016\/0196-6774(89)90038-2","volume":"10","author":"R.M. Karp","year":"1989","unstructured":"Karp, R.M., Luby, M., Madras, N.: Monte-Carlo approximation algorithms for enumeration problems. Journal of Algorithms\u00a010, 429\u2013449 (1989)","journal-title":"Journal of Algorithms"},{"key":"48_CR16","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/1117454.1117456","volume":"7","author":"L. Getoor","year":"2005","unstructured":"Getoor, L., Diehl, C.P.: Link mining: A survey. SIGKDD Explorations\u00a07, 3\u201312 (2005)","journal-title":"SIGKDD Explorations"}],"container-title":["Lecture Notes in Computer Science","Knowledge Discovery in Databases: PKDD 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74976-9_48.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:50:20Z","timestamp":1619506220000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74976-9_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540749752","9783540749769"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74976-9_48","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[]}}