The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected (Q3036719)
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: The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected |
scientific article; zbMATH DE number 3831307
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected |
scientific article; zbMATH DE number 3831307 |
Statements
The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected (English)
0 references
1983
0 references
sharp-P completeness
0 references
directed network cuts
0 references
vertex covers
0 references
bipartite graph
0 references
antichains
0 references
partial order
0 references
network reliability
0 references
