Parallel Depth-First Search for Directed Acyclic Graphs.
Maxim NaumovAlysson VrielinkMichael GarlandPublished in: IA3@SC (2017)
Keyphrases
- depth first search
- directed acyclic graph
- breadth first search
- search tree
- equivalence class
- structural learning
- branch and bound
- conditional independence
- equivalence classes
- tree search
- directed graph
- spanning tree
- undirected graph
- routing problem
- random variables
- lower bound
- branch and bound algorithm
- global optimization
- upper bound