#### Filter Results:

- Full text PDF available (2)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Data Set Used

#### Key Phrases

Learn More

- Arijit Khan, Francesco Bonchi, Francesco Gullo, Andreas Nufer
- ArXiv
- 2015

Network reliability is a well-studied problem that requires to measure the probability that a target node is reachable from a source node in a probabilistic (or uncertain) graph, i.e., a graph where every edge is assigned a probability of existence. Many approaches and problem variants have been considered in the literature, all assuming that edge-existence… (More)

In this thesis, we analyze the problem of finding the top-k edge colors that maximize the reliability between a set of source nodes and a set of destination nodes in an uncertain, edgecolored graph. Given more than one source and one destination, we further need to specify the maximization problem. Two types of maximization problems are studied. In the… (More)

- ‹
- 1
- ›