The Min Mean-Weight Cycle in a Random Network

DOI10.1017/S0963548313000229zbMath1282.05062arXiv1201.3955OpenAlexW3103881221MaRDI QIDQ5397731

Claire Mathieu, David Bruce Wilson

Publication date: 24 February 2014

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1201.3955

zbMATH Keywords

min mean weight cycle

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Combinatorial optimization (90C27) Paths and cycles (05C38) Signed and weighted graphs (05C22) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (1)

Scaling window for mean-field percolation of averages

Cites Work

• Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 12th international workshop, APPROX 2009, and 13th international workshop, RANDOM 2009, Berkeley, CA, USA, August 21--23, 2009. Proceedings

This page was built for publication: The Min Mean-Weight Cycle in a Random Network