An improved lower bound on the length of the longest cycle in random graphs.
Michael AnastosPublished in: CoRR (2022)
Keyphrases
- random graphs
- lower bound
- upper bound
- graph theoretic
- maximum number
- branch and bound algorithm
- learning curves
- phase transition
- lower and upper bounds
- optimal solution
- np hard
- worst case
- objective function
- sufficiently accurate
- small world
- undirected graph
- vc dimension
- sample complexity
- attributed graphs
- simulated annealing