Optimal fault-tolerant routings with small routing tables for \(k\)-connected graphs
type: Item
instance of: scholarly article
title: Optimal fault-tolerant routings with small routing tables for \(k\)-connected graphs
zbMATH Open document ID: 1118.68376
author: Koichi Wada
author: Wei Chen
published in: Journal of Discrete Algorithms
publication date: 2007-04-26T00:00:00Z
Mathematics Subject Classification ID: 68M15
Mathematics Subject Classification ID: 68M14
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 5147107
zbMATH Keywords: fault tolerance
zbMATH Keywords: fixed routing
zbMATH Keywords: routing table
zbMATH Keywords: diameter
zbMATH Keywords: distributed computing
MaRDI profile type: Publication
full work available at URL: j.jda.2004.04.009
OpenAlex ID: W1973926450
cites work: Q3852212
cites work: Efficient fault-tolerant routings in networks
cites work: A new look at fault-tolerant network routing
cites work: Q3883524
cites work: Q4168622
cites work: Q5572939
cites work: Fault-tolerant routings in a \(\kappa\)-connected network
cites work: New results in graph routing
cites work: On fault tolerant routings in general networks
cites work: Q4373694
cites work: Efficient fault-tolerant fixed routings on \((k+1)\)-connected digraphs
cites work: Optimal fault-tolerant routings for connected graphs
DOI: 10.1016/J.JDA.2004.04.009
description: scientific article; zbMATH DE number 5147107