Linear programming bounds for cliques in Paley graphs.
Mark MagsinoDustin G. MixonHans ParshallPublished in: CoRR (2019)
Keyphrases
- linear programming
- maximal cliques
- graph structure
- weighted graph
- linear program
- lower bound
- maximum clique
- upper bound
- objective function
- optimal solution
- np hard
- graph theoretic
- graph theory
- network flow
- lower and upper bounds
- primal dual
- column generation
- graph model
- graph databases
- feasible solution
- worst case
- integer programming
- undirected graph
- dynamic programming
- graph partitioning
- graph structures
- graph matching
- directed graph
- random graphs
- image segmentation
- learning algorithm
- nonlinear programming
- graph clustering
- quadratic programming
- upper and lower bounds
- vc dimension
- complex structures
- graph mining