scientific article; zbMATH DE number 432837

MaRDI QIDQ3138971zbMATHFDO

Authors Sandeep Bhatt, David S. Greenberg, Tom Leighton, Pangfeng Liu

Publication date 20 October 1993

zbMATH Keywords

distributed algorithmsmessage passingon-line tree embeddings

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Distributed algorithms (68W15)

Cited in

(7)

• Deterministic parallel backtrack search
• Scheduling task-tree with additive scales on parallel/distributed machines
• Optimal speedup for backtrack search on a butterfly network
• Branch-and-bound and backtrack search on mesh-connected arrays of processors
• Analysis of randomized load distribution for reproduction trees in linear arrays and rings
• Asymptotically optimal dynamic tree evolution by rapidly mixing random walks on regular networks
• Scheduling task-trees with additive scales on parallel/distributed machines

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3138971)