New lower bound on the Shannon capacity of C7 from circular graphs.
Sven C. PolakAlexander SchrijverPublished in: CoRR (2018)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- branch and bound
- information theory
- optimal solution
- objective function
- np hard
- lower bounding
- hough transform
- graph theory
- graph representation
- graph matching
- graph theoretic
- lower and upper bounds
- shannon entropy
- subgraph isomorphism
- sample complexity
- search algorithm
- spanning tree
- complex structures
- graph model
- graph partitioning
- graph mining
- bipartite graph
- directed graph
- graphical models
- worst case