Efficient fault-tolerant fixed routings on \((k+1)\)-connected digraphs
type: Item
instance of: scholarly article
title: Efficient fault-tolerant fixed routings on \((k+1)\)-connected digraphs
zbMATH Open document ID: 0755.94025
DOI: 10.1016/0166-218X(92)90157-6
author: Koichi Wada
author: Kimio Kawaguchi
published in: Discrete Applied Mathematics
publication date: 1993-01-16T00:00:00Z
Mathematics Subject Classification ID: 94C99
Mathematics Subject Classification ID: 94C12
Mathematics Subject Classification ID: 94C15
zbMATH DE Number: 94332
zbMATH Keywords: communication network
zbMATH Keywords: node faults
zbMATH Keywords: graph
zbMATH Keywords: fault-tolerant measures
zbMATH Keywords: directed graphs
zbMATH Keywords: routings
MaRDI profile type: Publication
cites work: Efficient fault-tolerant routings in networks
cites work: A new look at fault-tolerant network routing
cites work: Authenticated Algorithms for Byzantine Agreement
cites work: Parallel concepts in graph theory
cites work: Fault-tolerant routings in a \(\kappa\)-connected network
cites work: Optimal fault-tolerant routings for connected graphs
cites work: On fault tolerant routings in general networks
full work available at URL: 0166-218x(92)90157-6
OpenAlex ID: W1991404387
description: scientific article; zbMATH DE number 94332