### Abstract

Given an unreliable communication network, we aim to find a most reliable source (MRS) on the network, which maximizes the expected number of nodes that are reachable from it. Although the problem of finding an MRS on general graphs is #P-hard, it is tractable in several types of sparse graphs. The ring-tree graph is such a kind of sparse graph that not only has the capability of failure tolerance but also holds an underlying tree topology which facilitates network administration. In this paper, we are concerned with unreliable general ring-tree graphs in which each edge has an independent operational probability while all nodes are immune to failures. We first design a complementary dynamic programming algorithm and then develop a parallel algorithm based on the underlying tree for finding an MRS on the network.

Original language | English (US) |
---|---|

Title of host publication | Combinatorial Optimization and Applications - 5th International Conference, COCOA 2011, Proceedings |

Pages | 98-112 |

Number of pages | 15 |

DOIs | |

State | Published - Aug 29 2011 |

Event | 5th Annual International Conference on Combinatorial Optimization and Applications, COCOA 2011 - Zhangjiajie, China Duration: Aug 4 2011 → Aug 6 2011 |

### Publication series

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

Volume | 6831 LNCS |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Other

Other | 5th Annual International Conference on Combinatorial Optimization and Applications, COCOA 2011 |
---|---|

Country | China |

City | Zhangjiajie |

Period | 8/4/11 → 8/6/11 |

### Keywords

- Most reliable source
- complementary dynamic programming
- general ring-tree graph
- parallel algorithm

### ASJC Scopus subject areas

- Theoretical Computer Science
- Computer Science(all)

## Fingerprint Dive into the research topics of 'A fast parallel algorithm for finding a most reliable source on a general ring-tree graph with unreliable edges'. Together they form a unique fingerprint.

## Cite this

*Combinatorial Optimization and Applications - 5th International Conference, COCOA 2011, Proceedings*(pp. 98-112). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6831 LNCS). https://doi.org/10.1007/978-3-642-22616-8_9