Recognizing Unordered Depth-First Search Trees of an Undirected Graph in Parallel.
Chen-Hsing PengBiing-Feng WangJia-Shung WangPublished in: IEEE Trans. Parallel Distributed Syst. (2000)
Keyphrases
- search tree
- undirected graph
- depth first search
- search algorithm
- search space
- branch and bound algorithm
- spanning tree
- directed graph
- iterative deepening
- tree search
- directed acyclic graph
- approximation algorithms
- branch and bound search
- complex networks
- b tree
- connected components
- sat solvers
- graph structure
- minimum cost
- root node
- branch and bound
- special case
- upper bound
- lower bound
- data structure
- objective function
- bayesian networks
- social networks