Philippe Flajolet, Kostas Hatzis, Sotiris Nikoletseas, Paul Spirakis  Home/Search
Context Related
| pauillac.inria.fr/al...FlHaNiSp00.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: pauillac.inria.fr/algo/flajole... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: : Graphs are models of communication networks. This paper applies symbolic combinatorial techniques in order to characterize the interplay between two parameters of a random graph, namely its density (the number of edges in the graph) and its robustness to link failures. Here, robustness means multiple connectivity by short disjoint paths. We determine the expected number of ways to get from a source to a destination via two edgedisjoint paths of length ` in the classical random graph... (Update)
Similar documents based on text: More All
0.5: Analysis and Experimental Evaluation of an Innovative .. - Chatzigiannakis.. (2000) (Correct)
0.4: Analysis of an Innovative and Efficient.. - Chatzigiannakis.. (Correct)
0.4: Analysis and Experimental Evaluation of an Innovative .. - Chatzigiannakis.. (2000) (Correct)
BibTeX entry: (Update)
P. Flajolet, S. N. Kostas Hatzis, and P. Spirakis. On the robustness of interconnections in random graphs: a symbolic approach. Theoretical Computer Science, 287(2):515--534, 2002. http://citeseer.ist.psu.edu/flajolet02robustness.html More
@misc{ flajolet02robustness,
author = "P. Flajolet and S. Hatzis and P. Spirakis",
title = "the robustness of interconnections in random graphs: a symbolic approach",
text = "P. Flajolet, S. N. Kostas Hatzis, and P. Spirakis. On the robustness of
interconnections in random graphs: a symbolic approach. Theoretical Computer
Science, 287(2):515--534, 2002.",
year = "2002",
url = "citeseer.ist.psu.edu/flajolet02robustness.html" }
Citations (may not include all citations):1120 Handbook of Mathematical Functions (context) - Abramowitz, Stegun - 1973
957 The Probabilistic Method (context) - Alon, Spencer - 1992
411 Random Graphs (context) - Bollob'as - 1985
267 Enumerative Combinatorics (context) - Stanley - 1986
157 Advanced Combinatorics (context) - Comtet - 1974
154 Combinatorial Enumeration (context) - Goulden, Jackson - 1983
143 Higher Transcendental Functions (context) - Erd'elyi - 1981
139 Ten Lectures on the Probabilistic Method (context) - Spencer - 1987
132 the Evolution of Random Graphs (context) - Erdos, R'enyi - 1960
108 An Introduction to the Analysis of Algorithms (context) - Sedgewick, Flajolet - 1996
92 Line Encyclopedia of Integer Sequences - Sloane, On- - 2000
60 GFUN: a Maple Package for the Manipulation of Generating and.. - Salvy, Zimmermann - 1994
50 Poisson Approximation (context) - Barbour, Holst et al. - 1992
48 Asymptotic Methods in Enumeration (context) - Bender - 1974
39 Automatic Average--case Analysis of Algorithms - Flajolet, Salvy et al. - 1991
[Article contains additional citations not shown here]
Documents on the same site (http://pauillac.inria.fr/algo/flajolet/Publications/): More
The Maximum of a Random Walk and Its Application to.. - Coffman, Flajolet.. (1997) (Correct)
The Average Case Analysis Of Algorithms - Saddle Point.. - Flajolet, Sedgewick (1994) (Correct)
The Analysis of Hybrid Trie Structures - Clément, Flajolet.. (1997) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC