An O(n+m)-time algorithm for finding a minimum-weight dominating set in a permutation graph

被引：11
|
作者：
Rhee, C
Liang, YD
Dhall, SK
Lakshmivarahan, S
机构：
[1] INDIANA UNIV PURDUE UNIV, DEPT COMP SCI, FT WAYNE, IN 46805 USA
[2] UNIV OKLAHOMA, SCH COMP SCI, NORMAN, OK 73019 USA
来源：
SIAM JOURNAL ON COMPUTING | 1996年 / 25卷 / 02期
关键词：
algorithm; dominating set; permutation graph;
D O I：
10.1137/S0097539794200383
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Farber and Keil [Algorithmica, 4 (1989), pp. 221-236] presented an O(n(3))-time algorithm for finding a minimum-weight dominating set in permutation graphs. This result was improved to O(n(2) log(2) n) by Tsai and Hsu [SIGAL '90 Algorithms, Lecture Notes in Computer Science, Springer-Verlag, New York, 1990, pp. 109-117] and to O(n(n + m)) by the authors of this paper [Inform. Process. Lett., 37 (1991), pp. 219-224], respectively. In this paper, we introduce a new faster algorithm that takes only O(n + rn) time to solve the same problem, where m is the number of edges in a graph of n vertices.
引用
收藏
页码：404 / 419
页数：16
相关论文
共 50 条
  • [21] Parallel Algorithm for Minimum Partial Dominating Set in Unit Disk Graph
    Hong, Weizhi
    Zhang, Zhao
    Ran, Yingli
    COMBINATORIAL OPTIMIZATION AND APPLICATIONS, COCOA 2021, 2021, 13135 : 527 - 537
  • [22] A sublinear time distributed algorithm for minimum-weight spanning trees
    Garay, JA
    Kutten, S
    Peleg, D
    SIAM JOURNAL ON COMPUTING, 1998, 27 (01) : 302 - 316
  • [23] A linear time algorithm for the minimum-weight feedback vertex set problem in series-parallel graphs
    Zhang S.-Q.
    Li G.-J.
    Li S.-G.
    Acta Mathematicae Applicatae Sinica, 2004, 20 (4) : 579 - 588
  • [24] Minimum Connected Dominating Set Algorithm with Weight in Wireless Sensor Networks
    Zhang Jing
    Jia Chun-fu
    2008 4TH INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS, NETWORKING AND MOBILE COMPUTING, VOLS 1-31, 2008, : 3973 - 3976
  • [25] A hybrid evolutionary algorithm with guided mutation for minimum weight dominating set
    Chaurasia, Sachchida Nand
    Singh, Alok
    APPLIED INTELLIGENCE, 2015, 43 (03) : 512 - 529
  • [26] A hybrid evolutionary algorithm with guided mutation for minimum weight dominating set
    Sachchida Nand Chaurasia
    Alok Singh
    Applied Intelligence, 2015, 43 : 512 - 529
  • [27] An Effective Hybrid Memetic Algorithm for the Minimum Weight Dominating Set Problem
    Lin, Geng
    Zhu, Wenxing
    Ali, Montaz M.
    IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2016, 20 (06) : 892 - 907
  • [28] A branch-and-reduce algorithm for finding a Minimum Independent Dominating Set in graphs
    Gaspers, Serge
    Liedloff, Mathieu
    Graph-Theoretic Concepts in Computer Science, 2006, 4271 : 78 - 89
  • [29] A distributed self-stabilizing algorithm for finding a connected dominating set in a graph
    Jain, A
    Gupta, A
    PDCAT 2005: Sixth International Conference on Parallel and Distributed Computing, Applications and Technologies, Proceedings, 2005, : 615 - 619
  • [30] An order-based algorithm for minimum dominating set with application in graph mining
    Chalupa, David
    INFORMATION SCIENCES, 2018, 426 : 101 - 116
12345