The most reliable subgraph problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4702 LNAI, Issue , 2007, Pages 471-478

  Hintsanen, Petteri ^a  

^a UNIVERSITY OF HELSINKI   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

DATA VISUALIZATION; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING; RANDOM PROCESSES; SET THEORY;

LINK ANALYSIS; POLYNOMIAL-TIME ALGORITHMS; PROBABILISTIC GRAPH; TERMINAL VERTICES;

GRAPH THEORY;

EID: 38049103663     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74976-9_48     Document Type: Conference Paper

References (16)

1. 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-127. ACM Press, New York (2004)
2. 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-178. IEEE Computer Society Press, Los Alamitos (2003)
3. Ramakrishnan, C., Milnor, W.H., Perry, M., Sheth, A.P.: Discovering informative connection subgraphs in multi-relational graphs. SIGKDD Explorations 7, 56-63 (2005)
4. Asthana, S., King, O.D., Gibbons, F.D., Roth, F.P.: Predicting protein complex membership using probabilistic network reliability. Genome Research 14, 1170-1175 (2004)
5. 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-49 (2006)
6. De Raedt, L., Kersting, K., Kimmig, A., Revoredo, K., Toivonen, H.: Compressing probabilistic Prolog programs (Submitted)
7. Colbourn, C.J.: The Combinatorics of Network Reliability. Oxford University Press, Oxford (1987)
8. Birnbaum, Z. W.: On the importance of different components in a multicomponent system. In: Multivariate Analysis - II, pp. 581-592 (1969)
9. Hong, J., Lie, C.: Joint reliability-importance of two edges in an undirected network. IEEE Transactions on Reliability 42, 17-33 (1993)
10. Page, L.B., Perry, J.E.: Reliability polynomials and link importance in networks. IEEE Transactions on Reliability 43, 51-58 (1994)
11. Valiant, L.G.: The complexity of enumeration and reliability problems. SIAM Journal on Computing 8, 410-421 (1979)
12. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company (1979)
13. Ball, M.O.: Complexity of network reliability computations. Networks 10, 153-165 (1980)
14. Valdes, J., Tarjan, R.E., Lawler, E.L.: The recognition of series-parallel digraphs. SIAM Journal on Computing 11, 298-313 (1982)
15. Karp, R.M., Luby, M., Madras, N.: Monte-Carlo approximation algorithms for enumeration problems. Journal of Algorithms 10, 429-449 (1989)
16. Getoor, L., Diehl, C.P.: Link mining: A survey. SIGKDD Explorations 7, 3-12 (2005)