Sparse Asymmetric Connectors in Communication Networks

DOI10.1007/11889342_66MaRDI QIDQ5504243zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

connectorfault-tolerant connectorrearrangeable network

Mathematics Subject Classification ID

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

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

Cited in

(7)

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

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)