DEADLOCK PREDICTION IN THE CASE OF DYNAMIC ROUTING

From MaRDI portal

Publication:3358213

Jump to:navigation, search

DOI10.1142/S012905419000014XzbMath0732.68015OpenAlexW2085940326MaRDI QIDQ3358213

Pierluigi Crescenzi, Daniel P. Bovet, Miriam Di Ianni

Publication date: 1990

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s012905419000014x

zbMATH Keywords

NP-completeness polynomial algorithms deadlock prediction Store-and-Forward Network

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10)

This page was built for publication: DEADLOCK PREDICTION IN THE CASE OF DYNAMIC ROUTING

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3358213&oldid=16619861"