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 claim: Wikidata QID (P12): Q57401519, #quickstatements; #temporary_batch_1707161894653
Set OpenAlex properties.
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Q228771 / rank
Normal rank
 
Property / author
 
Property / author: Alan M. Frieze / rank
 
Normal rank
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
links / mardi / namelinks / mardi / name
 

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
    0 references
    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

    Identifiers