Fast Rough Bounds for the Coefficients of the Network Reliability Polynomial

Alexey Rodionov

doi:10.1109/OPCS.2019.8880191

Fast Rough Bounds for the Coefficients of the Network Reliability Polynomial

Результат исследования: Публикации в книгах, отчётах, сборниках, трудах конференций › статья в сборнике материалов конференции › научная › рецензирование

1 Цитирования (Scopus)

Аннотация

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.

Язык оригинала	английский
Название основной публикации	2019 15th International Asian School-Seminar Optimization Problems of Complex Systems, OPCS 2019
Издатель	Institute of Electrical and Electronics Engineers Inc.
Страницы	147-151
Число страниц	5
ISBN (электронное издание)	9781728129860
DOI	https://doi.org/10.1109/OPCS.2019.8880191
Состояние	Опубликовано - авг 2019
Опубликовано для внешнего пользования	Да
Событие	15th International Asian School-Seminar Optimization Problems of Complex Systems, OPCS 2019 - Novosibirsk, Российская Федерация Продолжительность: 26 авг 2019 → 30 авг 2019

Серия публикаций

Название	2019 15th International Asian School-Seminar Optimization Problems of Complex Systems, OPCS 2019

Конференция

Конференция	15th International Asian School-Seminar Optimization Problems of Complex Systems, OPCS 2019
Страна	Российская Федерация
Город	Novosibirsk
Период	26.08.2019 → 30.08.2019

Доступ к документу

10.1109/OPCS.2019.8880191

Link to publication in Scopus

Fingerprint Подробные сведения о темах исследования «Fast Rough Bounds for the Coefficients of the Network Reliability Polynomial». Вместе они формируют уникальный семантический отпечаток (fingerprint).

Цитировать

Rodionov, A. (2019). Fast Rough Bounds for the Coefficients of the Network Reliability Polynomial. В 2019 15th International Asian School-Seminar Optimization Problems of Complex Systems, OPCS 2019 (стр. 147-151). [8880191] (2019 15th International Asian School-Seminar Optimization Problems of Complex Systems, OPCS 2019). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/OPCS.2019.8880191

Rodionov, Alexey. / Fast Rough Bounds for the Coefficients of the Network Reliability Polynomial. 2019 15th International Asian School-Seminar Optimization Problems of Complex Systems, OPCS 2019. Institute of Electrical and Electronics Engineers Inc., 2019. стр. 147-151 (2019 15th International Asian School-Seminar Optimization Problems of Complex Systems, OPCS 2019).

@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",

}

Rodionov, A 2019, Fast Rough Bounds for the Coefficients of the Network Reliability Polynomial. в 2019 15th International Asian School-Seminar Optimization Problems of Complex Systems, OPCS 2019., 8880191, 2019 15th International Asian School-Seminar Optimization Problems of Complex Systems, OPCS 2019, Institute of Electrical and Electronics Engineers Inc., стр. 147-151, 15th International Asian School-Seminar Optimization Problems of Complex Systems, OPCS 2019, Novosibirsk, Российская Федерация, 26.08.2019. https://doi.org/10.1109/OPCS.2019.8880191

Fast Rough Bounds for the Coefficients of the Network Reliability Polynomial. / Rodionov, Alexey.

2019 15th International Asian School-Seminar Optimization Problems of Complex Systems, OPCS 2019. Institute of Electrical and Electronics Engineers Inc., 2019. стр. 147-151 8880191 (2019 15th International Asian School-Seminar Optimization Problems of Complex Systems, OPCS 2019).

Результат исследования: Публикации в книгах, отчётах, сборниках, трудах конференций › статья в сборнике материалов конференции › научная › рецензирование

TY - GEN

T1 - Fast Rough Bounds for the Coefficients of the Network Reliability Polynomial

AU - Rodionov, Alexey

PY - 2019/8

Y1 - 2019/8

N2 - 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.

AB - 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.

KW - network reliability

KW - reliability polynomials

UR - http://www.scopus.com/inward/record.url?scp=85078012275&partnerID=8YFLogxK

U2 - 10.1109/OPCS.2019.8880191

DO - 10.1109/OPCS.2019.8880191

M3 - Conference contribution

AN - SCOPUS:85078012275

T3 - 2019 15th International Asian School-Seminar Optimization Problems of Complex Systems, OPCS 2019

SP - 147

EP - 151

BT - 2019 15th International Asian School-Seminar Optimization Problems of Complex Systems, OPCS 2019

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 15th International Asian School-Seminar Optimization Problems of Complex Systems, OPCS 2019

Y2 - 26 August 2019 through 30 August 2019

ER -

Rodionov A. Fast Rough Bounds for the Coefficients of the Network Reliability Polynomial. В 2019 15th International Asian School-Seminar Optimization Problems of Complex Systems, OPCS 2019. Institute of Electrical and Electronics Engineers Inc. 2019. стр. 147-151. 8880191. (2019 15th International Asian School-Seminar Optimization Problems of Complex Systems, OPCS 2019). https://doi.org/10.1109/OPCS.2019.8880191