Nearly Tight Bounds for the Longest Edge in an Tree in a VLSI Lay Out

M. Kaufmann. Nearly Tight Bounds for the Longest Edge in an Tree in a VLSI Lay Out. In CAAP. pages 169-180, 1984.

Authors

M. Kaufmann

This author has not been identified. Look up 'M. Kaufmann' in Google