Upper and lower bounds for graph-diameter problems with application to record allocation

Daniel S. Hirschberg, C. K. Wong. Upper and lower bounds for graph-diameter problems with application to record allocation. Journal of Combinatorial Theory, Series A, 26(1):66-74, 1979. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.