Routing with Polynomial Communication-Space Trade-Off
type: Item
instance of: scholarly article
title: Routing with Polynomial Communication-Space Trade-Off
zbMATH Open document ID: 0762.68025
DOI: 10.1137/0405013
author: Baruch Awerbuch
author: David Peleg
published in: SIAM Journal on Discrete Mathematics
publication date: 1992-09-27T00:00:00Z
Mathematics Subject Classification ID: 68W15
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 68M10
zbMATH DE Number: 64691
zbMATH Keywords: communication networks
zbMATH Keywords: routing tables
zbMATH Keywords: communication-space trade-offs
zbMATH Keywords: graph covers
MaRDI profile type: MaRDI publication profile
full work available at URL: https://doi.org/10.1137/0405013
OpenAlex ID: W2005580106
Recommended article: A trade-off between space and efficiency for routing tables
Recommended article: Q4733694
Recommended article: Improved routing strategies with succinct tables
Recommended article: Routing with Improved Communication-Space Trade-Off
Recommended article: Space-efficiency for routing schemes of stretch factor three
description: scientific article