OPTIMAL ALGORITHM FOR THE NEAREST COMMON DOMINATOR PROBLEM

被引：2
|
作者：
CHU, J [1 ]
机构：
[1] NEW MEXICO STATE UNIV,DEPT COMP SCI,LAS CRUCES,NM 88003
来源：
JOURNAL OF ALGORITHMS | 1992年 / 13卷 / 04期
关键词：
D O I：
10.1016/0196-6774(92)90063-I
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
In a directed acyclic graph G = (V, E) with a single source s, the nearest common dominator for a set of nodes U ⊂ V is the node d closest to U such that every path from s to any node in U goes through d. The distance between any node w and U is defined as the number of arcs in a shortest path from w to any node in U. We develop an optimal algorithm for finding the nearest common dominator d for U, which runs in time proportional to the number of arcs in between d and U. © 1992.
引用
收藏
页码：693 / 697
页数：5
相关论文
共 50 条
  • [31] An Optimal Algorithm for the Distinct Elements Problem
    Kane, Daniel M.
    Nelson, Jelani
    Woodruff, David P.
    PODS 2010: PROCEEDINGS OF THE TWENTY-NINTH ACM SIGMOD-SIGACT-SIGART SYMPOSIUM ON PRINCIPLES OF DATABASE SYSTEMS, 2010, : 41 - 52
  • [32] An optimal parallel algorithm for the multiselection problem
    Alsuwaiyel, MH
    PARALLEL COMPUTING, 2001, 27 (06) : 861 - 865
  • [33] A greedy algorithm for the optimal basis problem
    Burdakov, O
    BIT NUMERICAL MATHEMATICS, 1997, 37 (03) : 591 - 599
  • [34] Optimal algorithm for the orienteering tour problem
    Ramesh, R.
    Yoon, Yong-Seok
    Karwan, Mark
    ORSA journal on computing, 1992, 4 (02): : 155 - 164
  • [35] An Optimal Algorithm for the Weighted Median Problem
    Zhu, Daxin
    Wang, Xiaodong
    JOURNAL OF COMPUTERS, 2014, 9 (02) : 257 - 265
  • [36] The Elimination algorithm for the problem of optimal stopping
    Isaac Sonin
    Mathematical Methods of Operations Research, 1999, 49 (1) : 111 - 123
  • [37] Elimination algorithm for the problem of optimal stopping
    Sonin, Isaac
    Mathematical Methods of Operations Research, 49 (01): : 111 - 123
  • [38] Optimal parallel algorithm for the knapsack problem
    Li, Qing-Hua
    Li, Ken-Li
    Jiang, Sheng-Yi
    Zhang, Wei
    Ruan Jian Xue Bao/Journal of Software, 2003, 14 (05): : 891 - 896
  • [39] A greedy algorithm for the optimal basis problem
    Oleg Burdakov
    BIT Numerical Mathematics, 1997, 37 : 591 - 599
  • [40] An optimal parallel algorithm for the knapsack problem
    Li, KL
    7TH WORLD MULTICONFERENCE ON SYSTEMICS, CYBERNETICS AND INFORMATICS, VOL IX, PROCEEDINGS: COMPUTER SCIENCE AND ENGINEERING: II, 2003, : 132 - 135
12345