Graph Homomorphism Polynomials: Algorithms and Complexity.
Balagopal KomarathAnurag PandeyC. S. RahulPublished in: CoRR (2020)
Keyphrases
- computational complexity
- worst case
- learning algorithm
- graph theory
- data structure
- computationally efficient
- graph search
- complexity analysis
- polynomial time complexity
- breadth first search
- space complexity
- memory requirements
- benchmark datasets
- computational cost
- decision problems
- directed acyclic graph
- orders of magnitude
- theoretical analysis
- lower complexity
- significant improvement