Traveling in randomly embedded random graphs

DOI10.1002/rsa.20832zbMath1428.05282arXiv1411.6596OpenAlexW2962792950WikidataQ128755671 ScholiaQ128755671MaRDI QIDQ4973640

Wesley Pegden, Alan M. Frieze

Publication date: 28 November 2019

Published in: Random Structures & Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

shortest pathunit squaretraveling salesperson problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Paths and cycles (05C38) Distance in graphs (05C12)

Related Items (2)

Spanners in randomly weighted graphs: Euclidean case ⋮ Spanners in randomly weighted graphs: independent edge lengths

This page was built for publication: Traveling in randomly embedded random graphs