The Size of the Largest Strongly Connected Component of a Random Digraph with a Given Degree Sequence (Q4819245): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q57401519, #quickstatements; #temporary_batch_1707161894653 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q57401519 / rank | |||
Normal rank | |||
Revision as of 22:10, 5 February 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
