Sparse Asymmetric Connectors in Communication Networks

DOI10.1007/11889342_66zbMATH Open1158.90324OpenAlexW2038217764MaRDI QIDQ5504243FDOQ5504243

Authors: Harout Aydinian, Rudolf Ahlswede 

Publication date: 22 January 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11889342_66

Recommendations

• Construction of asymmetric connectors of depth two
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• Constructions of sparse asymmetric connectors with number theoretic methods
• Some Graph-Colouring Theorems with Applications to Generalized Connection Networks
• Controllable connector

zbMATH Keywords

connectorrearrangeable networkfault-tolerant connector

Mathematics Subject Classification ID

Applications of graph theory (05C90) Communication networks in operations research (90B18)

Cited In (7)

• Constructions of sparse asymmetric connectors with number theoretic methods
• Fault-Tolerant Spanners in Networks with Symmetric Directional Antennas
• Construction of asymmetric connectors of depth two
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• Controllable connector
• Some Graph-Colouring Theorems with Applications to Generalized Connection Networks
• Interactive Communication, Diagnosis and Error Control in Networks

This page was built for publication: Sparse Asymmetric Connectors in Communication Networks

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