scientific article; zbMATH DE number 1202980

MaRDI QIDQ4209362zbMATH OpenFDO

Authors Peter Høyer, Kim S. Larsen

Publication date 27 September 1998

zbMATH Keywords

graph algorithmmatchingpermutation routing

Mathematics Subject Classification ID

Computer system organization (68M99) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Optimal Bounds for Matching Routing on Trees
• Routing Permutations on Graphs via Matchings
• New results on routing via matchings on graphs

Cited in

(7)

• Routing permutations on graphs via factors
• Don't be too clever: Routing BMMC permutations on the MasPar MP-2
• New results on routing via matchings on graphs
• Optimal permutation routing for low-dimensional hypercubes
• Congestion-free Routings of Linear Complement Permutations
• Fast permutation routing in a class of interconnection networks
• Permutation routing on reconfigurable meshes

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 Q4209362)