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 条

[1] Approximation algorithm for minimum q-dominator partization problem
Das, Sayani
Mishra, Sounaka
DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2023,
[2] An optimal algorithm for the angle-restricted all nearest neighbor problem on the reconfigurable mesh
Nakano, K
Olariu, S
10TH INTERNATIONAL PARALLEL PROCESSING SYMPOSIUM - PROCEEDINGS OF IPPS '96, 1996, : 687 - 691
[3] An optimal parallel algorithm for the all-nearest-foreign-neighbors problem in arbitrary dimensions
Graf, T
Latha, NSJ
Kamakoti, V
Rangan, CP
FOURTH INTERNATIONAL CONFERENCE ON HIGH-PERFORMANCE COMPUTING, PROCEEDINGS, 1997, : 132 - 136
[4] A SIMPLE OPTIMAL PARALLEL ALGORITHM TO SOLVE THE LOWEST COMMON ANCESTOR PROBLEM
LIN, R
OLARIU, S
LECTURE NOTES IN COMPUTER SCIENCE, 1991, 497 : 455 - 461
[5] Optimal algorithm for the angle-restricted all nearest neighbor problem on the reconfigurable mesh, with applications
Nagoya Inst of Technology, Nagoya, Japan
IEEE Trans Parallel Distrib Syst, 9 (983-990):
[6] Optimal parameters for Nearest Neighbor Deblurring algorithm
Kuzmin, Alexandru
WCECS 2007: WORLD CONGRESS ON ENGINEERING AND COMPUTER SCIENCE, 2007, : 1025 - 1027
[7] An optimal algorithm for the angle-restricted all nearest neighbor problem on the reconfigurable mesh, with applications
Nakano, K
Olariu, S
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1997, 8 (09) : 983 - 990
[8] A DATA STRUCTURE AND AN ALGORITHM FOR THE NEAREST POINT PROBLEM
KALANTARI, I
MCDONALD, G
IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1983, 9 (05) : 631 - 634
[9] A GEOMETRIC PROBLEM INVOLVING THE NEAREST NEIGHBOR ALGORITHM
MEIR, A
OPERATIONS RESEARCH LETTERS, 1987, 6 (06) : 289 - 291
[10] On problem of nearest common fixed point of nonexpansive mappings
Zhang Shi-sheng
APPLIED MATHEMATICS AND MECHANICS-ENGLISH EDITION, 2006, 27 (07) : 883 - 889

← 1 2 3 4 5 →