Lower Bounds for the Graph Homomorphism Problem.
Fedor V. FominAlexander GolovnevAlexander S. KulikovIvan MihajlinPublished in: ICALP (1) (2015)
Keyphrases
- lower bound
- upper bound
- min sum
- graph model
- graph structure
- graph theory
- branch and bound algorithm
- objective function
- random walk
- directed graph
- graph representation
- spanning tree
- lower and upper bounds
- worst case
- graph theoretic
- connected components
- weighted graph
- graph mining
- np hard
- graph partitioning
- network flow
- quadratic assignment problem
- max sat
- network flow formulation
- clustering algorithm
- edge weights
- bipartite graph
- learning theory
- optimal solution
- bayesian networks