Three-dimensional meshes are less powerful than two-dimensional ones in oblivious routing

DOI10.1007/3-540-63397-9_22MaRDI QIDQ826097zbMATH OpenOpenAlexFDO

Authors Kazuo Iwama, Eiji Miyano

Publication date 20 December 2021

Full work available at URL https://doi.org/10.1007/3-540-63397-9_22

zbMATH Keywords

parallel algorithmbisection widthdisjoint subsetselementary path

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40) Parallel algorithms in computer science (68W10)

Recommendations

• A lower bound for elementary oblivious routing on three-dimensional meshes
• Oblivious routing algorithms on the mesh of buses
• New bounds for oblivious mesh routing
• Optimal oblivious routing on \(d\)-dimensional meshes
• scientific article; zbMATH DE number 1305438

Cited in

(1)

• A lower bound for elementary oblivious routing on three-dimensional meshes

This page was built for publication: Three-dimensional meshes are less powerful than two-dimensional ones in oblivious routing

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