NIST · ИТ · df12a0694e77477100a8
Fast Sequential Importance Sampling to Estimate the Graph Reliability Polynomial
The reliability polynomial of a graph measures the number of its connected subgraphs of various sizes. Algortihms based on sequential importance sampling (SIS) have been proposed to estimate a graph's reliahbility polynomial. We develop an improved SIS
NIST · ИТОфициальный источник · 2012-11-08
{
"title_en": "Fast Sequential Importance Sampling to Estimate the Graph Reliability Polynomial",
"designation": "",
"series": "",
"status": "",
"date": "2012-11-08",
"date_original": "November 8, 2012",
"url": "https://www.nist.gov/publications/fast-sequential-importance-sampling-estimate-graph-reliability-polynomial",
"source": "NIST Publications",
"display_en": "",
"authors_en": "David G. Harris, Francis Sullivan, Isabel M. Beichl",
"abstract_excerpt_en": "The reliability polynomial of a graph measures the number of its connected subgraphs of various sizes. Algortihms based on sequential importance sampling (SIS) have been proposed to estimate a graph's reliahbility polynomial. We develop an improved SIS",
"id": "df12a0694e77477100a8",
"sources": [
"NIST Publications"
],
"source_records": [
{
"title_en": "Fast Sequential Importance Sampling to Estimate the Graph Reliability Polynomial",
"designation": "",
"series": "",
"status": "",
"date": "2012-11-08",
"date_original": "November 8, 2012",
"url": "https://www.nist.gov/publications/fast-sequential-importance-sampling-estimate-graph-reliability-polynomial",
"source": "NIST Publications",
"display_en": "",
"authors_en": "David G. Harris, Francis Sullivan, Isabel M. Beichl",
"abstract_excerpt_en": "The reliability polynomial of a graph measures the number of its connected subgraphs of various sizes. Algortihms based on sequential importance sampling (SIS) have been proposed to estimate a graph's reliahbility polynomial. We develop an improved SIS"
}
],
"translation_state": "none"
}