Hardness of Approximate Diameter: Now for Undirected Graphs.
Mina DalirrooyfardRay LiVirginia Vassilevska WilliamsPublished in: FOCS (2021)
Keyphrases
- undirected graph
- average degree
- directed graph
- phase transition
- directed acyclic graph
- approximation algorithms
- complex networks
- minimum cost
- connected components
- np hard
- positive integer
- graph structure
- spanning tree
- computational complexity
- disjoint paths
- np complete
- random graphs
- vertex set
- linear program
- worst case