DEADLOCK PREDICTION IN THE CASE OF DYNAMIC ROUTING
type: Item
instance of: scholarly article
title: DEADLOCK PREDICTION IN THE CASE OF DYNAMIC ROUTING
zbMATH Open document ID: 0732.68015
DOI: 10.1142/S012905419000014X
author: Daniel P. Bovet
author: Miriam Di Ianni
author: Pilu Crescenzi
published in: International Journal of Foundations of Computer Science
publication date: 1990-01-01T00:00:00Z
Mathematics Subject Classification ID: 68M10
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 4211469
zbMATH Keywords: polynomial algorithms
zbMATH Keywords: Store-and-Forward Network
zbMATH Keywords: deadlock prediction
zbMATH Keywords: NP-completeness
MaRDI profile type: MaRDI publication profile
full work available at URL: s012905419000014x
OpenAlex ID: W2085940326
Recommended article: Predicting deadlock in store‐and‐forward networks
Recommended article: Q4536925
Recommended article: Q3817607
Recommended article: Optimal centralized algorithms for store-and-forward deadlock avoidance
Recommended article: Q3709879
description: scientific article; zbMATH DE number 4211469