On the computational complexity of continuous routing

DOI10.1016/0196-6774(89)90025-4zbMath0685.68045OpenAlexW2079018846MaRDI QIDQ4203819

Janos Simon, Susanne E. Hambrusch, Yukon Chang

Publication date: 1989

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-6774(89)90025-4

zbMATH Keywords

networkNP-hardnessdistributed algorithmscontinuous broadcastingcontinuous routing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Theory of operating systems (68N25) Theory of software (68N99)

This page was built for publication: On the computational complexity of continuous routing