Space-efficient and fault-tolerant message routing in outerplanar networks

DOI10.1109/12.9731zbMath0663.68051OpenAlexW2079103108MaRDI QIDQ3814807

Ravi Janardan, Greg N. Frederickson

Publication date: 1988

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/12.9731

zbMATH Keywords

shortest pathsfault-tolerancecommunication complexityouterplanar graphdistributed networksmessage routingnode naming

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15)

Related Items

Designing networks with compact routing tables ⋮ Efficient distributed algorithms for single-source shortest paths and related problems on plane networks ⋮ Survey article: consequences of some outerplanarity extensions