The diameter of randomly perturbed digraphs and some applications (Q5297137): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q57401500, #quickstatements; #temporary_batch_1712286835472
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Typical properties of winners and losers in discrete optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527008 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undirected ST-connectivity in log-space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smoothed analysis of algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Data Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4336277 / rank
 
Normal rank

Latest revision as of 12:24, 26 June 2024

scientific article; zbMATH DE number 5172153
Language Label Description Also known as
English
The diameter of randomly perturbed digraphs and some applications
scientific article; zbMATH DE number 5172153

    Statements

    The diameter of randomly perturbed digraphs and some applications (English)
    0 references
    0 references
    0 references
    0 references
    18 July 2007
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    connectivity algorithms
    0 references
    random digraphs
    0 references
    0 references
    0 references