A lower bound on the size of (H; 1)-vertex stable graphs.
Sylwia CichaczAgnieszka GörlichMateusz NikodemAndrzej ZakPublished in: Discret. Math. (2012)
Keyphrases
- lower bound
- upper bound
- directed graph
- undirected graph
- branch and bound algorithm
- labeled graphs
- maximum clique
- maximal cliques
- optimal solution
- branch and bound
- constant factor
- objective function
- np hard
- computational complexity
- spanning tree
- lower and upper bounds
- sufficiently accurate
- hamiltonian cycle
- uniform random
- attributed graphs
- strongly connected
- graph mining
- graph theory
- graph matching
- memory requirements