Efficient algorithms for computing the reliability of permutation and interval graphs (Q3211090)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient algorithms for computing the reliability of permutation and interval graphs |
scientific article |
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
