Linear-Time Algorithm for the Paired-Domination Problem in Convex Bipartite Graphs

被引：11
|
作者：
Hung, Ruo-Wei [1 ]
机构：
[1] Chaoyang Univ Technol, Dept Comp Sci & Informat Engn, Taichung 41349, Taiwan
来源：
THEORY OF COMPUTING SYSTEMS | 2012年 / 50卷 / 04期
关键词：
Graph algorithms; Linear-time algorithms; Paired-domination; Total domination; Convex bipartite graphs; EFFICIENT ALGORITHMS; MAXIMUM MATCHINGS; INTERVAL;
D O I：
10.1007/s00224-011-9378-8
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
A bipartite graph G=(U,W,E) with vertex set V=Ua(a)W is convex if there exists an ordering of the vertices of W such that for each uaU, the neighbors of u are consecutive in W. A compact representation of a convex bipartite graph for specifying such an ordering can be computed in O(|V|+|E|) time. The paired-domination problem on bipartite graphs has been shown to be NP-complete. The complexity of the paired-domination problem on convex bipartite graphs has remained unknown. In this paper, we present an O(|V|) time algorithm to solve the paired-domination problem on convex bipartite graphs given a compact representation. As a byproduct, we show that our algorithm can be directly applied to solve the total domination problem on convex bipartite graphs in the same time bound.
引用
收藏
页码：721 / 738
页数：18
相关论文
共 50 条
  • [1] Linear-Time Algorithm for the Paired-Domination Problem in Convex Bipartite Graphs
    Ruo-Wei Hung
    [J]. Theory of Computing Systems, 2012, 50 : 721 - 738
  • [2] Efficient Algorithm for the Paired-Domination Problem in Convex Bipartite Graphs
    Hung, Ruo-Wei
    Laio, Chi-Hyi
    Wang, Chun-Kai
    [J]. INTERNATIONAL MULTICONFERENCE OF ENGINEERS AND COMPUTER SCIENTISTS (IMECS 2010), VOLS I-III, 2010, : 365 - 369
  • [3] A linear-time algorithm for paired-domination problem in strongly chordal graphs
    Chen, Lei
    Lu, Changhong
    Zeng, Zhenbing
    [J]. INFORMATION PROCESSING LETTERS, 2009, 110 (01) : 20 - 23
  • [4] A linear-time algorithm for weighted paired-domination on block graphs
    Ching-Chi Lin
    Cheng-Yu Hsieh
    Ta-Yu Mu
    [J]. Journal of Combinatorial Optimization, 2022, 44 : 269 - 286
  • [5] A linear-time algorithm for weighted paired-domination on block graphs
    Lin, Ching-Chi
    Hsieh, Cheng-Yu
    Mu, Ta-Yu
    [J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2022, 44 (01) : 269 - 286
  • [6] A LINEAR-TIME ALGORITHM FOR THE RESTRICTED PAIRED-DOMINATION PROBLEM IN COGRAPHS
    Hung, Ruo-Wei
    [J]. INTERNATIONAL JOURNAL OF INNOVATIVE COMPUTING INFORMATION AND CONTROL, 2010, 6 (11): : 4957 - 4978
  • [7] A linear-time algorithm for paired-domination on circular-arc graphs
    Lin, Ching-Chi
    Tu, Hai-Lun
    [J]. THEORETICAL COMPUTER SCIENCE, 2015, 591 : 99 - 105
  • [8] Linear-Time Algorithm for Paired-Domination on Distance-Hereditary Graphs
    Mu, Ta-Yu
    Lin, Ching-Chi
    [J]. COMPUTING AND COMBINATORICS, COCOON 2022, 2022, 13595 : 357 - 367
  • [9] An O(n)-Time Algorithm for the Paired-Domination Problem on Permutation Graphs
    Lappas, Evaggelos
    Nikolopoulos, Stavros D.
    Palios, Leonidas
    [J]. COMBINATORIAL ALGORITHMS, 2009, 5874 : 368 - 379
  • [10] A polynomial-time algorithm for the paired-domination problem on permutation graphs
    Cheng, T. C. E.
    Kang, Liying
    Shan, Erfang
    [J]. DISCRETE APPLIED MATHEMATICS, 2009, 157 (02) : 262 - 271
12345