On the addressing problem for directed graphs
From MaRDI portal
Publication:1068101
DOI10.1007/BF02582927zbMath0581.05030MaRDI QIDQ1068101
Peter M. Winkler, Fan R. K. Chung, Ronald L. Graham
Publication date: 1985
Published in: Graphs and Combinatorics (Search for Journal in Brave)
extremal set theory; Hamming distances; matrix factorization; distance matrix; strongly connected digraph; addressing digraphs; addressing problem; communications network
15A23: Factorization of matrices
94C15: Applications of graph theory to circuits and networks
05C20: Directed graphs (digraphs), tournaments
Related Items
Biclique coverings of regular bigraphs and minimum semiring ranks of regular matrices, Representations of graphs and networks (coding, layouts and embeddings), Applying a proof of tverberg to complete bipartite decompositions of digraphs and multigraphs
Cites Work