Deterministic parallel backtrack search
From MaRDI portal
Publication:5958310
DOI10.1016/S0304-3975(00)00386-8zbMath0984.68205MaRDI QIDQ5958310
Kieran T. Herley, Geppino Pucci, Andrea Pietracaprina
Publication date: 3 March 2002
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Randomized parallel algorithms for backtrack search and branch-and-bound computation
- Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time
- Dynamic Tree Embeddings in Butterflies and Hypercubes
- Optimal speedup for backtrack search on a butterfly network
- Branch-and-bound and backtrack search on mesh-connected arrays of processors
- Near‐perfect token distribution
- DETERMINISTIC BRANCH-AND-BOUND ON DISTRIBUTED MEMORY MACHINES
This page was built for publication: Deterministic parallel backtrack search