Shortest node-disjoint paths on random graphs

DOI10.1088/1742-5468/2014/07/P07009zbMath1456.05143arXiv1401.8096OpenAlexW3101176358MaRDI QIDQ3301996

No author found.

Publication date: 11 August 2020

Published in: Journal of Statistical Mechanics: Theory and Experiment (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Communication networks in operations research (90B18)

Related Items (3)

Solving the edge‐disjoint paths problem using a two‐stage method ⋮ The cavity approach for Steiner trees packing problems ⋮ Self-organization scheme for balanced routing in large-scale multi-hop networks

Cites Work

• Routing and wavelength assignment in optical networks using bin packing based algorithms
• Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
• The cavity method at zero temperature
• Graph minors. XIII: The disjoint paths problem
• A post-optimization method for the routing and wavelength assignment problem applied to scheduled lightpath demands
• Statistical mechanics of complex networks
• Information, Physics, and Computation
• Reducibility among Combinatorial Problems
• From the physics of interacting polymers to optimizing routes on the London Underground
• Poly-logarithmic Approximation for Maximum Node Disjoint Paths with Constant Congestion
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Shortest node-disjoint paths on random graphs