Login / Signup
Nearly Tight Bounds for the Longest Edge in an Tree in a VLSI Lay Out.
Michael Kaufmann
Published in:
CAAP (1984)
Keyphrases
</>
tight bounds
upper bound
tree structure
lower bound
edge detector
signal processing
tree structures
tree models
edge detection
hierarchical structure
vlsi design
edge information
index structure
weighted graph
spanning tree
minimum spanning trees
b tree
tree construction
binary tree
gray level
denoising
multiresolution