Works (1)

Updated: July 5th, 2023 14:34

2020 journal article

Efficient algorithms for finding2-mediansof a tree

NETWORKS, 77(3), 383–402.

By: A. Oudjit n & M. Stallmann n

author keywords: 2-median; binary search; linear time; priority queue; sorting; trees
TL;DR: A framework that unifies all efficient algorithms for the 2‐median problem on trees is presented, which isolates the nonlinear part of the computation so that future time‐bound improvements are easily incorporated. (via Semantic Scholar)
Sources: Web Of Science, ORCID, NC State University Libraries
Added: October 5, 2020

Citation Index includes data from a number of different sources. If you have questions about the sources of data in the Citation Index or need a set of data which is free to re-distribute, please contact us.

Certain data included herein are derived from the Web of Science© and InCites© (2024) of Clarivate Analytics. All rights reserved. You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.