Network reliability and the factoring theorem (Q4740315): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/net.3230130107 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2008013300 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4158362 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Use of S-Functions in Combinatorial Analysis / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 16:59, 13 June 2024
scientific article; zbMATH DE number 3795659
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Network reliability and the factoring theorem |
scientific article; zbMATH DE number 3795659 |
Statements
Network reliability and the factoring theorem (English)
0 references
1983
0 references
network reliability analysis
0 references
factoring theorem
0 references
computational complexity
0 references
domination
0 references
optimal binary structure
0 references
algorithm
0 references
connectedness test for subgraphs
0 references
