General first-passage percolation

DOI10.2307/1426987MaRDI QIDQ4749872zbMATH OpenOpenAlexFDO

Authors Colin 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

clutternetwork flowspercolationrandom network

Mathematics Subject Classification ID

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

Cited in

(10)

• The maximal flow through a directed graph with random capacities
• On the greedy algorithm with random costs
• Hamiltonicity in random directed graphs is born resilient
• Rainbow Hamilton cycles in random graphs
• Spanning cycles in random directed graphs
• On oriented cycles in randomly perturbed digraphs
• Cycles and trees in randomly perturbed sparse digraphs
• How many random edges make an almost-Dirac graph Hamiltonian?
• Cycles of every length and orientation in randomly perturbed digraphs (extended abstract)
• Randomly perturbed digraphs also have bounded-degree spanning trees

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4749872)