scientific article
From MaRDI portal
Publication:3823140
zbMATH Open0669.68032MaRDI QIDQ3823140
Publication date: 1988
Title of this publication is not available (Why is that?)
discrete mathematicscomputational complexitycombinatorial problemsanalysis of algorithmsdata structuresLower boundminimum weighted path length
Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Discrete mathematics in relation to computer science (68R99)
Related Items (5)
Tight Upper and Lower Bounds on the Path Length of Binary Trees ⋮ ON WEIGHTED PATH LENGTHS AND DISTANCES IN INCREASING TREES ⋮ The optimal pebbling number of the complete \(m\)-ary tree ⋮ Size and Weight of Shortest Path Trees with Exponential Link Weights ⋮ EXTREMAL WEIGHTED PATH LENGTHS IN RANDOM BINARY SEARCH TREES
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3823140)
