From the physics of interacting polymers to optimizing routes on the London Underground

DOI10.1073/pnas.1301111110zbMath1292.90072arXiv1309.0745OpenAlexW2055375625WikidataQ37117743 ScholiaQ37117743MaRDI QIDQ5170973

C. H. Yeung, K. Y. M. Wong, David Saad

Publication date: 25 July 2014

Published in: Proceedings of the National Academy of Sciences (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Deterministic network models in operations research (90B10) Statistical mechanics of polymers (82D60) Internet topics (68M11)

Related Items

Navigability of interconnected networks under random failures ⋮ Bandwidth allocation and resource adjustment for stability enhancement in complex networks ⋮ Shortest node-disjoint paths on random graphs ⋮ Self-organization scheme for balanced routing in large-scale multi-hop networks

Uses Software

• NetDraw

Cites Work

• A note on two problems in connexion with graphs
• An implementation of linear and nonlinear multicommodity network flows
• Unfoldings of quasi-periodic tori in reversible systems
• On a routing problem
• The maximum concurrent flow problem
• Information, Physics, and Computation
• Statistical Physics of Spin Glasses and Information Processing
• Solving a Time-Space Network Formulation for the Convoy Movement Problem
• Greedy distributed optimization of multi-commodity flows

This page was built for publication: From the physics of interacting polymers to optimizing routes on the London Underground