Bounded Search Tree Algorithms for Parameterized Cograph Deletion: Efficient Branching Rules by Exploiting Structures of Special Graph Classes
James NastosYong GaoPublished in: CoRR (2010)
Keyphrases
- search tree
- depth first search
- search algorithm
- binary search trees
- computational complexity
- search space
- orders of magnitude
- tree search
- high dimensional
- root node
- optimization problems
- backtracking algorithm
- branch and bound algorithm
- search strategies
- b tree
- weighted graph
- combinatorial optimization
- metaheuristic
- state space
- mobile robot
- objective function