Efficient Anytime Anywhere Algorithms for Vertex Additions in Large and Dynamic Graphs.
Eunice E. SantosJohn KorahVairavan MurugappanSuresh SubramanianPublished in: IPDPS Workshops (2017)
Keyphrases
- computationally efficient
- graph theory
- computationally expensive
- data structure
- theoretical analysis
- undirected graph
- computational cost
- significant improvement
- learning algorithm
- computationally intensive
- dynamic graph
- dynamic programming
- np hard
- lower bound
- directed graph
- computationally complex
- polynomial time complexity