A reliability-improving graph transformation with applications to network reliability (Q3989403): 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.3230220206 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2047154829 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3328583 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Maximizing the number of spanning trees in a graph with n nodes and m edges / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 16:05, 15 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A reliability-improving graph transformation with applications to network reliability |
scientific article |
Statements
A reliability-improving graph transformation with applications to network reliability (English)
0 references
28 June 1992
0 references
probabilistic flow
0 references
highly connected nets
0 references
reliability
0 references
threshold net
0 references