On the addressing problem for directed graphs

DOI10.1007/BF02582927zbMath0581.05030MaRDI QIDQ1068101

Ronald L. Graham, Peter M. Winkler, Fan R. K. Chung

Publication date: 1985

Published in: Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

extremal set theoryHamming distancesmatrix factorizationdistance matrixstrongly connected digraphaddressing digraphsaddressing problemcommunications network

Mathematics Subject Classification ID

Factorization of matrices (15A23) Applications of graph theory to circuits and networks (94C15) Directed graphs (digraphs), tournaments (05C20)

Related Items

Applying a proof of tverberg to complete bipartite decompositions of digraphs and multigraphs, Representations of graphs and networks (coding, layouts and embeddings), Dynamic resource location with tropical algebra, Biclique coverings of regular bigraphs and minimum semiring ranks of regular matrices

Cites Work

• Proof of the squashed cube conjecture
• On the Addressing Problem for Loop Switching
• Unnamed Item
• Unnamed Item