scientific article; zbMATH DE number 7375850
From MaRDI portal
Publication:5002651
DOI10.4230/LIPIcs.APPROX-RANDOM.2017.45zbMath1467.05243MaRDI QIDQ5002651
Publication date: 28 July 2021
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
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)
Cites Work
- Unnamed Item
- Unnamed Item
- An algorithm for finding Hamilton paths and cycles in random graphs
- Subadditive Euclidean functionals and nonlinear growth in geometric probability
- A sharp deviation inequality for the stochastic traveling salesman problem
- On the stretch factor of randomly embedded random graphs
- Expected Computation Time for Hamiltonian Path problem
- Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
- Random Geometric Graphs
- The Diameter of Sparse Random Graphs
- The diameter of sparse random graphs