scientific article; zbMATH DE number 512926

MaRDI QIDQ4281639zbMATH OpenFDO

Authors Shmuel Zaks, Ornan Gerstel

Publication date 10 March 1994

zbMATH Keywords

distributed ranking problemdistributed sorting problemmediantree

Mathematics Subject Classification ID

Trees (05C05) Structural characterization of families of graphs (05C75) Distributed algorithms (68W15)

Recommendations

• A new characterization of tree medians with applications to distributed sorting
• A self-stabilizing distributed algorithm to find the median of a tree graph
• scientific article; zbMATH DE number 4085448
• Mathematical Foundations of Computer Science 2003
• An O(pn^ 2) algorithm for the p-median and related problems on tree graphs
• scientific article; zbMATH DE number 1834653
• Computing the 2‐median on tree networks in O(n lg n) time
• The median procedure for n-trees
• Efficient algorithms for finding <scp>2‐medians</scp> of a tree
• Median and hybrid median K-dimensional trees

Cited in

(8)

• A self-stabilizing distributed algorithm to find the median of a tree graph
• The median of the n-dimensional abstract tree
• scientific article; zbMATH DE number 4024389 (Why is no real title available?)
• A new characterization of tree medians with applications to distributed sorting
• Computing the 2‐median on tree networks in O(n lg n) time
• A modification of the median of a tree
• The asymmetric median tree. --- A new model for building consensus trees
• Medians and centres of polyominoes

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