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 条
  • [21] An optimal polynomial time algorithm for the common cycle economic lot and delivery scheduling problem
    Jensen, MT
    Khouja, M
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2004, 156 (02) : 305 - 311
  • [22] Nearest common ancestors: A survey and a new algorithm for a distributed environment
    Alstrup, S
    Gavoille, C
    Kaplan, H
    Rauhe, T
    THEORY OF COMPUTING SYSTEMS, 2004, 37 (03) : 441 - 456
  • [23] Nearest Common Ancestors: A Survey and a New Algorithm for a Distributed Environment
    Stephen Alstrup
    Cyril Gavoille
    Haim Kaplan
    Theis Rauhe
    Theory of Computing Systems, 2004, 37 : 441 - 456
  • [24] An optimal algorithm for approximate nearest neighbor searching in fixed dimensions
    Arya, S
    Mount, DM
    Netanyahu, NS
    Silverman, R
    Wu, AY
    JOURNAL OF THE ACM, 1998, 45 (06) : 891 - 923
  • [25] Optimal pointer algorithms for finding nearest common ancestors in dynamic trees
    Alstrup, S
    Thorup, M
    JOURNAL OF ALGORITHMS, 2000, 35 (02) : 169 - 188
  • [26] An active index algorithm for the nearest point problem in a polyhedral cone
    Liu, Zhe
    Fathi, Yahya
    COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2011, 49 (03) : 435 - 456
  • [27] An active index algorithm for the nearest point problem in a polyhedral cone
    Zhe Liu
    Yahya Fathi
    Computational Optimization and Applications, 2011, 49 : 435 - 456
  • [28] Linear convergence rate for the MDM algorithm for the Nearest Point Problem
    Lopez, Jorge
    Dorronsoro, Jose R.
    PATTERN RECOGNITION, 2015, 48 (04) : 1510 - 1522
  • [29] Algorithm for the multiple common subgraph problem
    Bayada, Denis M.
    Simpson, Richard W.
    Johnson, A. Peter
    Laurenco, Claude
    Journal of Chemical Information and Computer Sciences, 1992, 32 (06):
  • [30] AN ALGORITHM FOR THE MULTIPLE COMMON SUBGRAPH PROBLEM
    BAYADA, DM
    SIMPSON, RW
    JOHNSON, AP
    LAURENCO, C
    JOURNAL OF CHEMICAL INFORMATION AND COMPUTER SCIENCES, 1992, 32 (06): : 680 - 685
12345