Tight Hardness for Shortest Cycles and Paths in Sparse Graphs.
Andrea LincolnVirginia Vassilevska WilliamsR. Ryan WilliamsPublished in: SODA (2018)
Keyphrases
- shortest path
- worst case
- path length
- graph theory
- gaussian graphical models
- lower bound
- sparse representation
- graph matching
- graph theoretic
- sparse data
- weighted graph
- high dimensional
- random graphs
- upper bound
- computational complexity
- linear combination
- series parallel
- phase transition
- sparse matrix
- small world
- undirected graph
- path finding
- optimal path
- graph mining
- search algorithm
- information theoretic
- np complete