An introduction to the analysis of algorithms
An introduction to the analysis of algorithms
Optimal construction of edge-disjoint paths in random graphs
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Short Vertex Disjoint Paths and Multiconnectivity in Random Graphs: Reliable Network Computing
ICALP '94 Proceedings of the 21st International Colloquium on Automata, Languages and Programming
Gossiping in Vertex-Disjoint Paths Mode in d-Dimensional Grids and Planar Graphs
ESA '93 Proceedings of the First Annual European Symposium on Algorithms
Analytic Combinatorics
| Hi-index | 0.00 |
Graphs are models of communication networks. This paper applies combinatorial and symbolic-analytic techniques in order to characterize the interplay between two parameters of a random graph: its density (the number of edges in the graph) and its robustness to link failures, where robustness here means multiple connectivity by short disjoint paths. A triple (G, s, t), where G is a graph and s, t are designated vertices, is called l - robust if s and t are connected via at least two edge-disjoint paths of length at most l. We determine here the expected number of ways to get from s to t via two edge-disjoint paths in the random graph model Gn,p. We then derive bounds on related threshold probabilities pn,l as functions of l and n.