Tight Hardness for Shortest Cycles and Paths in Sparse Graphs.
Andrea LincolnVirginia Vassilevska WilliamsR. Ryan WilliamsPublished in: CoRR (2017)
Keyphrases
- shortest path
- path length
- worst case
- lower bound
- upper bound
- small world
- graph matching
- gaussian graphical models
- np complete
- graph theoretic
- weighted graph
- sparse data
- dictionary learning
- high dimensional
- graph databases
- directed graph
- np hard
- graph theory
- sparse representation
- directed acyclic
- learning theory
- complex structures
- sparse coding
- information theoretic
- optimal path
- compressive sensing
- semi supervised
- random graphs