General first-passage percolation

DOI10.2307/1426987zbMath0511.05055OpenAlexW4233951178MaRDI QIDQ4749872

Colin J. H. McDiarmid

Publication date: 1983

Published in: Advances in Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/1426987

zbMATH Keywords

percolationnetwork flowsclutterrandom network

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Special processes (60K99) Graph theory (05C99)

Related Items (4)

Rainbow hamilton cycles in random graphs ⋮ On the greedy algorithm with random costs ⋮ Hamiltonicity in random directed graphs is born resilient ⋮ The maximal flow through a directed graph with random capacities

This page was built for publication: General first-passage percolation