scientific article; zbMATH DE number 1043915

MaRDI QIDQ4346817zbMATH OpenFDO

Authors Kripasindhu Sikdar

Publication date 1 February 1998

zbMATH Keywords

parallel algorithmtreespath lengths

Mathematics Subject Classification ID

Applications of graph theory (05C90) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38)

Recommendations

• On the number of t-ary trees with a given path length
• Generalized trees and their applications
• scientific article; zbMATH DE number 176528
• Paths in \(m\)-ary interval trees
• Tight Upper and Lower Bounds on the Path Length of Binary Trees
• Path-tables of trees: a survey and some new results
• On the path length of binary trees
• On the average path length of complete \(m\)-ary trees
• Generalized trees related with tree metrics
• A \(q\)-analogue of the path length of binary search trees

Cited in

(4)

• Staircase tilings and \(k\)-Catalan structures
• Effect of parallelism on the efficiency of binary tree search.
• On the number of \(t\)-ary trees with a given path length
• scientific article; zbMATH DE number 4122014 (Why is no real title available?)

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 Q4346817)