The diameter of randomly perturbed digraphs and some applications
From MaRDI portal
Publication:5297137
DOI10.1002/rsa.20172zbMath1125.05094WikidataQ57401500 ScholiaQ57401500MaRDI QIDQ5297137
Abraham D. Flaxman, Alan M. Frieze
Publication date: 18 July 2007
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.20172
05C80: Random graphs (graph-theoretic aspects)
68R10: Graph theory (including graph drawing) in computer science
05C85: Graph algorithms (graph-theoretic aspects)
05C20: Directed graphs (digraphs), tournaments
Related Items
Smoothed analysis of balancing networks, On the average path length of a cycle plus random edges, Shortcutting directed and undirected networks with a degree constraint, Smoothed Analysis on Connected Graphs, Smoothed Analysis of Local Search Algorithms
Cites Work