The strongly connected reliability of complete digraphs (Q4680417): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
(5 intermediate revisions by 4 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1002/net.20060 / rank | |||
Property / author | |||
Property / author: Jason I. Brown / rank | |||
Property / author | |||
Property / author: Xiao Hu Li / rank | |||
Property / author | |||
Property / author: Jason I. Brown / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Xiao Hu Li / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1002/net.20060 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W4248853006 / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1002/NET.20060 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 15:02, 30 December 2024
scientific article; zbMATH DE number 2173327
Language | Label | Description | Also known as |
---|---|---|---|
English | The strongly connected reliability of complete digraphs |
scientific article; zbMATH DE number 2173327 |
Statements
The strongly connected reliability of complete digraphs (English)
0 references
1 June 2005
0 references
algorithm
0 references
reachability
0 references