Fault tolerant networks of specified diameter

DOI10.1007/3-540-50728-0_36OpenAlexW1545749076MaRDI QIDQ6199455FDOQ6199455

Authors

Publication date 28 February 2024

Published in Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-50728-0_36

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40)

Recommendations

• Efficient fault-tolerant fixed routings on \((k+1)\)-connected digraphs
• Connectivity of Regular Directed Graphs with Small Diameters
• On fault tolerant routings in general networks
• Publication:4724657
• Design of a d-connected digraph with a minimum number of edges and a quasiminimal diameter

This page was built for publication: Fault tolerant networks of specified diameter

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6199455)