Local Computation Algorithms for Graphs of Non-Constant Degrees.
Reut LeviRonitt RubinfeldAnak YodpinyaneePublished in: CoRR (2015)
Keyphrases
- graph theory
- data structure
- np complete
- times faster
- neural network
- computational complexity
- computational cost
- theoretical analysis
- subgraph isomorphism
- convergence rate
- data mining algorithms
- orders of magnitude
- data sets
- computationally efficient
- significant improvement
- graph embedding
- learning algorithm
- polynomial time complexity