Finding reliable subgraphs from large probabilistic graphs

Data Mining and Knowledge Discovery

Volumn 17, Issue 1, 2008, Pages 3-23

  Hintsanen, Petteri ^a   Toivonen, Hannu ^a  

^a UNIVERSITY OF HELSINKI   (Finland)

Author keywords

Graph mining; Graph visualization; Link discovery and analysis; Reliability

Indexed keywords

HEURISTIC PROGRAMMING; PORT TERMINALS; PROBABILITY; RISK ASSESSMENT; WIRELESS TELECOMMUNICATION SYSTEMS;

BIOLOGICAL DOMAIN; BUSINESS MEDIA; GRAPH ALGORITHMS; INPUT GRAPHS; LARGE GRAPHS; PROBABILISTIC GRAPHS; RANDOM EDGES; SUB GRAPHS; SUB-GRAPHS; SUBGRAPH EXTRACTION; TECHNICAL DETAILS; TERMINAL VERTICES; TERMINALS (AIRPORT);

GRAPH THEORY;

EID: 48349139682     PISSN: 13845810     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10618-008-0106-1     Document Type: Conference Paper

References (13)

1. Birnbaum ZW (1969) On the importance of different components in a multicomponent system. Multivar Anal II:581-592
2. Bryant RE (1986) Graph-based algorithms for boolean function manipulation. IEEE Trans Comput 35: 677-691
3. Colbourn CJ (1987) The combinatorics of network reliability. Oxford University Press, Oxford
4. De Raedt L, Kersting K, Kimmig A, Revoredo K, Toivonen H (2008) Compressing probabilistic Prolog programs. Mach Learn 70: 151-168
5. Duffin RJ (1965) Topology of series-parallel networks. J Math Anal Appl 10: 303-318
6. Eppstein D (1998) Finding the k shortest paths. SIAM J Comput 28: 652-673
7. 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-127
8. Hershberger J, Maxel M, Suri S (2007) Finding the k shortest simple paths: a new algorithm and its implementation. ACM Trans Algorithms 3: 45
9. 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-478
10. 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-405
11. 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-928
12. 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-49
13. Valdes J, Tarjan RE, Lawler EL (1982) The recognition of series-parallel digraphs. SIAM J Comput 11: 298-313