On the addressing problem for directed graphs

descriptionPublicationkeyboard_double_arrow_right Article 01 Dec 1985 English Publisher:Springer Science and Business Media LLCJournal:Graphs and Combinatorics, volume 1, pages 41-50 (issn: 0911-0119, eissn: 1435-5914,

Copyright policy )

Authors: Fan R. K. Chung; Ronald L. Graham; Peter M. Winkler;

doi: 10.1007/bf02582927

On the addressing problem for directed graphs

- Summary
- Subjects
- Metrics

Abstract

zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Related Organizations

Emory University
United States
Bell Labs
United States
Core Competence
United States
Telcordia Technologies
United States

Keywords

Hamming distances, Directed graphs (digraphs), tournaments, extremal set theory, matrix factorization, Factorization of matrices, distance matrix, addressing digraphs, Applications of graph theory to circuits and networks, communications network, strongly connected digraph, addressing problem

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	6
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average