Three-dimensional meshes are less powerful than two-dimensional ones in oblivious routing
From MaRDI portal
Publication:826097
DOI10.1007/3-540-63397-9_22zbMATH Open1477.68529OpenAlexW1581126175MaRDI QIDQ826097
Publication date: 20 December 2021
Full work available at URL: https://doi.org/10.1007/3-540-63397-9_22
Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)
This page was built for publication: Three-dimensional meshes are less powerful than two-dimensional ones in oblivious routing