Bounded Search Tree Algorithms for Parametrized Cograph Deletion: Efficient Branching Rules by Exploiting Structures of Special Graph Classes.
James NastosYong GaoPublished in: Discret. Math. Algorithms Appl. (2012)
Keyphrases
- search tree
- depth first search
- search algorithm
- root node
- branch and bound algorithm
- backtracking algorithm
- binary search trees
- search space
- database
- b tree
- tree search
- combinatorial optimization
- orders of magnitude
- lower bound
- computational complexity
- search strategy
- branch and bound
- graph structure
- optimization problems
- database systems