Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Burago, Dmitri | de Rougemont, Michel
Affiliations: Department of Mathematics, Penn-State University, University Park, U.S.A. email address : burago@math.psu.edu | Department of Computer Science, University Paris II, Paris, France. email address : mdr@lri.fr
Note: [] Address for correspondence: Department of Mathematics, Penn-State University, University Park, USA.
Note: [] Department of Computer Science, University Paris II, Paris, France.
Abstract: We introduce classes of narrow graphs (including grid strips of fixed width), for which the graph reliability problem admits a polynomial time algorithm. Using this algorithm, we show that graph reliability is computable in polynomial time for the average complexity with respect to a Gaussian distribution. The latter is defined as follows: the vertices are numbered by integers {1,2, ...n}, and the probability that an edge between i and j is present is e−|i−j|2.
Keywords: graph reliability, average complexity
DOI: 10.3233/FI-1998-3641
Journal: Fundamenta Informaticae, vol. 36, no. 4, pp. 307-315, 1998
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
sales@iospress.com
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
info@iospress.nl
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office info@iospress.nl
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
china@iospress.cn
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
如果您在出版方面需要帮助或有任何建, 件至: editorial@iospress.nl