Efficient algorithms for computing the reliability of permutation and interval graphs (Q3211090)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Publication:3211090 |
scientific article; zbMATH DE number 4191379
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient algorithms for computing the reliability of permutation and interval graphs |
scientific article; zbMATH DE number 4191379 |
Statements
Efficient algorithms for computing the reliability of permutation and interval graphs (English)
0 references
1990
0 references
reliability of networks
0 references
perfect edges
0 references
unreliable nodes
0 references
reliable Steiner tree
0 references
interval graphs
0 references
permutation graphs
0 references
cographs
0 references
chordal graphs
0 references
0 references
0.823688805103302
0 references
0.807750403881073
0 references
0.8012375235557556
0 references
0.8008338212966919
0 references
0.8005267977714539
0 references
