Maximal paths in random dynamic graphs
From MaRDI portal
Publication:1104336
DOI10.1016/S0195-6698(87)80036-7zbMath0647.05029MaRDI QIDQ1104336
Publication date: 1987
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Almost all regular graphs are Hamiltonian
- On the connectivity of random m-orientable graphs and digraphs
- Matchings in random regular bipartite digraphs
- Probabilistic analysis of some Euclidean clustering problems
- A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
- Hamiltonian circuits in random graphs
- On the Expected Value of a Random Assignment Problem
- Probabilistic Analysis of the Planar k-Median Problem
- Random Graphs and Graph Optimization Problems
- Optimization Problems on Graphs with Independent Random Edge Weights
- Worst-Case and Probabilistic Analysis of a Geometric Location Problem
- A Fast Algorithm for the Euclidean Traveling Salesman Problem, Optimal with Probability One
- Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
This page was built for publication: Maximal paths in random dynamic graphs
