Monte-Carlo approximation algorithms for enumeration problems
Journal of Algorithms
The Combinatorics of Network Reliability
The Combinatorics of Network Reliability
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Unsupervised Link Discovery in Multi-relational Data via Rarity Analysis
ICDM '03 Proceedings of the Third IEEE International Conference on Data Mining
Fast discovery of connection subgraphs
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
ACM SIGKDD Explorations Newsletter
Discovering informative connection subgraphs in multi-relational graphs
ACM SIGKDD Explorations Newsletter
Link discovery in graphs derived from biological databases
DILS'06 Proceedings of the Third international conference on Data Integration in the Life Sciences
Finding reliable subgraphs from large probabilistic graphs
Data Mining and Knowledge Discovery
Variable compression in ProbLog
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Discovering highly reliable subgraphs in uncertain graphs
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Fast discovery of reliable k-terminal subgraphs
PAKDD'10 Proceedings of the 14th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining - Volume Part II
Patterns and logic for reasoning with networks
Bisociative Knowledge Discovery
| Hi-index | 0.00 |
We introduce the problem of finding the most reliable subgraph: given a probabilistic graph Gsubject to random edge failures, a set of terminal vertices, and an integer Kfind a subgraph H茂戮驴 Ghaving Kfewer edges than G, such that the probability of connecting the terminals in His maximized. The solution has applications in link analysis and visualization. We begin by formally defining the problem in a general form, after which we focus on a two-terminal, undirected case. Although the problem is most likely computationally intractable, we give a polynomial-time algorithm for a special case where Gis seriesparallel. For the general case, we propose a computationally efficient greedy heuristic. Our experiments on simulated graphs illustrate the usefulness of the concept of most reliable subgraph, and suggest that the heuristic for the general case is quite competitive.