A new lower bound on upper irredundance in the queens' graph.
Matthew D. KearsePeter B. GibbonsPublished in: Discret. Math. (2002)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- graph representation
- np hard
- random walk
- branch and bound
- objective function
- lower and upper bounds
- optimal solution
- directed graph
- worst case
- graph theory
- connected components
- graph based algorithm
- lower bounding
- directed acyclic graph
- graph model
- graph mining
- bipartite graph
- graph matching
- structured data
- graph structure
- neural network
- competitive ratio
- search space
- polynomial approximation