Lower Bounds for the Graph Homomorphism Problem.
Fedor V. FominAlexander GolovnevAlexander S. KulikovIvan MihajlinPublished in: CoRR (2015)
Keyphrases
- lower bound
- upper bound
- objective function
- np hard
- branch and bound algorithm
- graph theoretic
- structured data
- graph theory
- min sum
- lower and upper bounds
- optimal solution
- graph model
- weighted graph
- directed graph
- quadratic assignment problem
- random walk
- graph representation
- spanning tree
- graph structure
- branch and bound
- directed acyclic graph
- upper and lower bounds
- constant factor
- graph based algorithm
- connected components
- constraint satisfaction problems
- graph databases
- bipartite graph
- graph partitioning
- graph matching
- combinatorial optimization
- search algorithm