Skip to main navigation Skip to search Skip to main content

Using meaning of coefficients of the reliability polynomial for their faster calculation

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We propose some new approaches to the problem of obtaining the reliability polynomial of a random graph. The meaning of coefficients of the reliability polynomial in one of its presentation is used for the significant reducing of calculations while the factoring method underlies. Experiments shows significant speeding up in compare with well known package Maple 11 (up to 2000 times on the standard lattice example).

Original languageEnglish
Title of host publicationComputational Science and Its Applications - ICCSA 2009 - International Conference, Proceedings
Pages557-571
Number of pages15
EditionPART 2
DOIs
StatePublished - 2009
EventInternational Conference on Computational Science and Its Applications, ICCSA 2009 - Seoul, Korea, Republic of
Duration: 29 Jun 20092 Jul 2009

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
NumberPART 2
Volume5593 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

ConferenceInternational Conference on Computational Science and Its Applications, ICCSA 2009
Country/TerritoryKorea, Republic of
CitySeoul
Period29/06/092/07/09

Keywords

  • Factoring method
  • Reliability polynomial

Fingerprint

Dive into the research topics of 'Using meaning of coefficients of the reliability polynomial for their faster calculation'. Together they form a unique fingerprint.

Cite this