Efficient Algorithms for Finding Depth-First and Breadth-First Search Trees in Permutation Graphs.
Chong Jye RheeY. Daniel LiangSudarshan K. DhallS. LakshmivarahanPublished in: Inf. Process. Lett. (1994)
Keyphrases
- search tree
- search algorithm
- iterative deepening
- depth first search
- search space
- branch and bound search
- branching factor
- branch and bound algorithm
- b tree
- tree search
- binary search trees
- root node
- symmetry breaking
- evolutionary algorithm
- connected graphs
- database
- heuristic function
- spanning tree
- sat solvers
- branch and bound
- heuristic search
- test collection
- data analysis
- database systems