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 条

[41] Parallel Genetic Algorithm for Minimum Dominating Set Problem
Cu Nguyen Giap
Dinh Thi Ha
2014 INTERNATIONAL CONFERENCE ON COMPUTING, MANAGEMENT AND TELECOMMUNICATIONS (COMMANTEL), 2014, : 165 - 169
[42] A memetic algorithm for minimum independent dominating set problem
Yiyuan Wang
Jiejiang Chen
Huanyao Sun
Minghao Yin
Neural Computing and Applications, 2018, 30 : 2519 - 2529
[43] Hybrid Genetic Algorithm for Minimum Dominating Set Problem
Hedar, Abdel-Rahman
Ismail, Rashad
COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2010, PT 4, PROCEEDINGS, 2010, 6019 : 457 - +
[44] Hybrid bat algorithm for minimum dominating set problem
Abed, Saad Adnan
Rais, Helmi Md
JOURNAL OF INTELLIGENT & FUZZY SYSTEMS, 2017, 33 (04) : 2329 - 2339
[45] Parallel algorithms for minimum general partial dominating set and maximum budgeted dominating set in unit disk graph
Hong, Weizhi
Ran, Yingli
Zhang, Zhao
THEORETICAL COMPUTER SCIENCE, 2022, 932 : 13 - 20
[46] A LINEAR-TIME ALGORITHM TO COMPUTE A DOMINATING PATH IN AN AT-FREE GRAPH
CORNEIL, DG
OLARIU, S
STEWART, L
INFORMATION PROCESSING LETTERS, 1995, 54 (05) : 253 - 257
[47] A New Distributed Algorithm for Computing a Dominating Set on Grids
Pisantechakool, Photchchara
Tan, Xuehou
FRONTIERS IN ALGORITHMICS (FAW 2015), 2015, 9130 : 217 - 228
[48] A linear time algorithm for optimal k-hop dominating set of a tree
Kundu, Sukhamay
Majumder, Subhashis
INFORMATION PROCESSING LETTERS, 2016, 116 (02) : 197 - 202
[49] Efficient Algorithm for the Paired-Domination Problem in Convex Bipartite Graphs
Hung, Ruo-Wei
Laio, Chi-Hyi
Wang, Chun-Kai
INTERNATIONAL MULTICONFERENCE OF ENGINEERS AND COMPUTER SCIENTISTS (IMECS 2010), VOLS I-III, 2010, : 365 - 369
[50] Polynomial time algorithm for computing a minimum geodetic set in outerplanar graphs
Mezzini, Mauro
THEORETICAL COMPUTER SCIENCE, 2018, 745 : 63 - 74

← 1 2 3 4 5 →