Pages that link to "Item:Q1204800"
From MaRDI portal
The following pages link to Parallel search algorithms for graphs and trees (Q1204800):
Displaying 9 items.
- Efficient parallel graph algorithms based on open ear decomposition (Q688195) (← links)
- Parallel computation of matchings in trees (Q1179213) (← links)
- Parallel local search for Steiner trees in graphs (Q1808193) (← links)
- A unified approach to the parallel construction of search trees (Q1898213) (← links)
- Sequential and parallel solution-biased search for subgraph algorithms (Q2327237) (← links)
- Space-Efficient Parallel Algorithms for Combinatorial Search Problems (Q2849956) (← links)
- Parallel algorithms for a depth first search and a breadth first search (Q3802639) (← links)
- Efficient Parallel Algorithms for Graphs of Bounded Tree-Width (Q4864433) (← links)
- Successive approximation in parallel graph algorithms (Q5096155) (← links)