Cliques, holes and the vertex coloring polytope.
Manoel B. CampêloRicardo C. CorrêaYuri FrotaPublished in: Inf. Process. Lett. (2004)
Keyphrases
- hamiltonian cycle
- directed graph
- lattice points
- stable set
- traveling salesman problem
- convex hull
- random variables
- graph structure
- maximal cliques
- phase transition
- minimum weight
- neural network
- facet defining inequalities
- weighted graph
- random walk
- graph coloring
- undirected graph
- maximum clique
- community structure
- real time
- multiagent evolutionary algorithm