Research Article
On the 2-MRS Problem in a Tree with Unreliable Edges
| Notation | Explanation |
| | An undirected connected graph | | An undirected tree graph | | A rooted version of with as the root | | An edge of graph | | A node pair | | A simple path connecting nodes and (also, the event that works correctly) | | The probability of working correctly | | The probability of reaching | | The set of nodes on | | The set of edges on | | The set of the children of in | | The subtree of rooted at | | The set of nodes in | | The set of nodes outside | | The parent of in | | The set of ancestors of in | | The child of on in | | The set of children of in other than | | The number of the most ancestors of node in | | The current level of () | | The set of nodes on the -level of | | The set of leaves of | | The set of leaves of | | The union of two disjoint sets and | | The superior probability | | The united probability | | The superior probability of to | | The united probability of to | | The sum reachability of | | The sum reachability in of | | The sum reachability in of | | The sum reachability in of | | The minimum reachability of | | The minimum reachability in of | | The minimum reachability in of | | The minimum reachability in of |
|
|