@inproceedings{cd5d34218e0544919921de3bdc78dac3,
title = "Fast Rough Bounds for the Coefficients of the Network Reliability Polynomial",
abstract = "The problem of fast estimating of reliability polynomial' coefficients is considered in the paper in the case of all-terminal reliability (probability of a graph being connected). Obtaining lower and upper bounds for each coefficient of a reliability polynomial in one of its possible representation is based on counting all trivially known connected and disconnected realizations (states) of a random graph, based on easily derived information about graph's structure, such as existence of chains and their lengths.",
keywords = "network reliability, reliability polynomials",
author = "Alexey Rodionov",
year = "2019",
month = aug,
doi = "10.1109/OPCS.2019.8880191",
language = "English",
series = "2019 15th International Asian School-Seminar Optimization Problems of Complex Systems, OPCS 2019",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "147--151",
booktitle = "2019 15th International Asian School-Seminar Optimization Problems of Complex Systems, OPCS 2019",
address = "United States",
note = "15th International Asian School-Seminar Optimization Problems of Complex Systems, OPCS 2019 ; Conference date: 26-08-2019 Through 30-08-2019",
}