Enumerating disjunctions and conjunctions of paths and cuts in reliability theory (Q867855): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: An algorithm for enumerating all directed spanning trees in a directed graph / rank | |||
Normal rank | |||
Revision as of 10:01, 4 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Enumerating disjunctions and conjunctions of paths and cuts in reliability theory |
scientific article |
Statements
Enumerating disjunctions and conjunctions of paths and cuts in reliability theory (English)
0 references
19 February 2007
0 references
path and cut enumeration
0 references
