Branch-and-bound and backtrack search on mesh-connected arrays of processors
From MaRDI portal
Publication:4311641
DOI10.1007/BF01184935zbMath0812.68068MaRDI QIDQ4311641
Giuseppe Persiano, Christos Kaklamanis
Publication date: 14 May 1995
Published in: Mathematical Systems Theory (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
68P10: Searching and sorting
68W15: Distributed algorithms
Related Items
DETERMINISTIC BRANCH-AND-BOUND ON DISTRIBUTED MEMORY MACHINES, Deterministic parallel backtrack search, Asymptotically optimal dynamic tree evolution by rapidly mixing random walks on regular networks, Towards optimal locality in mesh-indexings, Scheduling task-trees with additive scales on parallel/distributed machines, Analysis of randomized load distribution for reproduction trees in linear arrays and rings
Cites Work