The Size of the Largest Strongly Connected Component of a Random Digraph with a Given Degree Sequence (Q4819245): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user 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.1017/s096354830400611x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1987070596 / rank | |||
Normal rank | |||
Latest revision as of 11:04, 30 July 2024
scientific article; zbMATH DE number 2103162
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Size of the Largest Strongly Connected Component of a Random Digraph with a Given Degree Sequence |
scientific article; zbMATH DE number 2103162 |
Statements
The Size of the Largest Strongly Connected Component of a Random Digraph with a Given Degree Sequence (English)
0 references
24 September 2004
0 references
strong connectivity
0 references
fan-in
0 references
fan-out
0 references
bow-tie digraph
0 references
characterization
0 references
giant component
0 references
