On the longest path of a randomly weighted tournament

DOI10.1016/j.dam.2017.07.003zbMath1368.05084OpenAlexW2737728945MaRDI QIDQ2399297

Raphael Yuster

Publication date: 22 August 2017

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2017.07.003

zbMATH Keywords

tournamentlongest pathrandom weighing

Mathematics Subject Classification ID

Paths and cycles (05C38) Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20) Signed and weighted graphs (05C22)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Powers of Hamilton cycles in tournaments
• An easy proof of the \(\zeta (2)\) limit in the random assignment problem
• On the value of a random minimum spanning tree problem
• Hamiltonian circuits in random graphs
• The ?(2) limit in the random assignment problem
• On the Expected Value of a Random Assignment Problem
• On Shortest Paths in Graphs with Random Weights
• A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem
• On the Length of a Random Minimum Spanning Tree
• All-Pairs Shortest Paths in $O(n^2)$ time with high probability
• On Random Symmetric Travelling Salesman Problems
• A Priori Optimization

This page was built for publication: On the longest path of a randomly weighted tournament