A linear time algorithm for computing a minimum paired-dominating set of a convex bipartite graph

被引：8
|
作者：
Panda, B. S. [1 ]
Pradhan, D. [1 ]
机构：
[1] Indian Inst Technol Delhi, Dept Math, Comp Sci & Applicat Grp, New Delhi 110016, India
来源：
DISCRETE APPLIED MATHEMATICS | 2013年 / 161卷 / 12期
关键词：
Paired-domination; Perfect matching; Convex bipartite graphs; INTERVAL;
D O I：
10.1016/j.dam.2012.04.014
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
A set D of vertices of a graph G = (V, E) is a dominating set of G if every vertex in V\D has at least one neighbor in D.A dominating set D of G is a paired-dominating set of G if the induced subgraph, G[D], has a perfect matching. The paired-domination problem is for a given graph G and a positive integer k to answer if G has a paired-dominating set of size at most k. The paired-domination problem is known to be NP-complete even for bipartite graphs. In this paper, we propose a linear time algorithm to compute a minimum paired-dominating set of a convex bipartite graph. (c) 2012 Elsevier B.V. All rights reserved.
引用
收藏
页码：1776 / 1783
页数：8
相关论文
共 50 条
  • [21] MINIMUM DOMINATING SET FOR THE PRISM GRAPH FAMILY
    Esther, Jebisha S.
    Vivik, Veninstine J.
    MATHEMATICS IN APPLIED SCIENCES AND ENGINEERING, 2023, 4 (01): : 30 - 39
  • [22] An order-based algorithm for minimum dominating set with application in graph mining
    Chalupa, David
    INFORMATION SCIENCES, 2018, 426 : 101 - 116
  • [23] Exponential time algorithms for the minimum dominating set problem on some graph classes
    Gaspers, Serge
    Kratsch, Dieter
    Liedloff, Mathieu
    ALGORITHM THEORY - SWAT 2006, PROCEEDINGS, 2006, 4059 : 148 - 159
  • [24] Exponential Time Algorithms for the Minimum Dominating Set Problem on Some Graph Classes
    Gaspers, Serge
    Kratsch, Dieter
    Liedloff, Mathieu
    Todinca, Ioan
    ACM TRANSACTIONS ON ALGORITHMS, 2009, 6 (01)
  • [25] An O(n+m)-time algorithm for finding a minimum-weight dominating set in a permutation graph
    Rhee, C
    Liang, YD
    Dhall, SK
    Lakshmivarahan, S
    SIAM JOURNAL ON COMPUTING, 1996, 25 (02) : 404 - 419
  • [26] A linear time algorithm for maximum matchings in convex, bipartite graphs
    Steiner, G
    Yeomans, JS
    COMPUTERS & MATHEMATICS WITH APPLICATIONS, 1996, 31 (12) : 91 - 96
  • [27] FINDING A MINIMUM INDEPENDENT DOMINATING SET IN A PERMUTATION GRAPH
    ATALLAH, MJ
    MANACHER, GK
    URRUTIA, J
    DISCRETE APPLIED MATHEMATICS, 1988, 21 (03) : 177 - 183
  • [28] Minimum connected dominating set and backbone of a random graph
    Habibulla, Yusupjan
    Zhou, Hai-Jun
    JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT, 2024, 2024 (06):
  • [29] A 5+ε-approximation algorithm for minimum weighted dominating set in unit disk graph
    Dai, Decheng
    Yu, Changyuan
    THEORETICAL COMPUTER SCIENCE, 2009, 410 (8-10) : 756 - 765
  • [30] An Exact Algorithm for the Minimum Dominating Set Problem
    Jiang, Hua
    Zheng, Zhifei
    PROCEEDINGS OF THE THIRTY-SECOND INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, IJCAI 2023, 2023, : 5604 - 5612
12345