Cited by 851
Hewlett-Packard (United States)
ORCID: 0000-0001-7420-1751Publishes on Advanced Graph Theory Research, Graph theory and applications, Data Management and Algorithms. 195 papers and 6.9k citations.
Add your photo, update your bio, and get notified when your ranking changes.
Let T n denote a tree with n nodes that is rooted at node r. (For definitions not given here see [ 4 ] or [ 10 ].) The altitude of a node u in T n is the distance α = α (u, T n ) between r and u in T n . The width of T n at altitude is the number W k = W k (T n ) of nodes at altitude in T n , where = 0, 1, …