A Linear-Time Algorithm for 2-Step Domination in Block Graphs

被引：0
|
作者：
Yancai ZHAO [1 ,2 ]
Lianying MIAO [3 ]
Zuhua LIAO [1 ]
机构：
[1] School of Science,Jiangnan University
[2] Wuxi City College of Vocational Technology
[3] Department of Mathematics,China University of Mining and Technology
来源：
JournalofMathematicalResearchwithApplications | 2015年 / 35卷 / 03期
基金：
中国国家自然科学基金;
关键词：
2-step domination; block graph; algorithm; labeling method;
D O I：
暂无
中图分类号：
O157.5 [图论];
学科分类号：
070104 ;
摘要：
The 2-step domination problem is to find a minimum vertex set D of a graph such that every vertex of the graph is either in D or at distance two from some vertex of D.In the present paper,by using a labeling method,we provide an O(m) time algorithm to solve the2-step domination problem on block graphs,a superclass of trees.
引用
收藏
页码：285 / 290
页数：6
相关论文
共 50 条
  • [41] A linear-time algorithm for 7-coloring 1-planar graphs
    Chen, ZZ
    Kouno, M
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2003, PROCEEDINGS, 2003, 2747 : 348 - 357
  • [42] Mutual-visibility in distance-hereditary graphs: a linear-time algorithm
    Cicerone, Serafino
    Di Stefano, Gabriele
    XII LATIN-AMERICAN ALGORITHMS, GRAPHS AND OPTIMIZATION SYMPOSIUM, LAGOS 2023, 2023, 224 : 104 - 111
  • [43] A simple linear-time modular decomposition algorithm for graphs, using order extension
    Habib, M
    de Montgolfier, F
    Paul, C
    ALGORITHM THEORY- SWAT 2004, 2004, 3111 : 187 - 198
  • [44] A linear-time algorithm to find independent spanning trees in maximal planar graphs
    Nagai, S
    Nakano, S
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2001, E84A (05): : 1102 - 1109
  • [45] A CHARACTERIZATION OF GRAPHS WITH INTERVAL 2-STEP GRAPHS
    LUNDGREN, JR
    MERZ, SK
    MAYBEE, JS
    RASMUSSEN, CW
    LINEAR ALGEBRA AND ITS APPLICATIONS, 1995, 217 : 203 - 223
  • [46] A Linear-Time Algorithm for 7-Coloring 1-Plane Graphs
    Zhi-Zhong Chen
    Mitsuharu Kouno
    Algorithmica, 2005, 43 : 147 - 177
  • [47] A Linear-Time Algorithm for Symmetric Convex Drawings of Internally Triconnected Plane Graphs
    Seok-Hee Hong
    Hiroshi Nagamochi
    Algorithmica, 2010, 58 : 433 - 460
  • [48] A linear-time certifying algorithm for recognizing generalized series-parallel graphs
    Chin, Francis Y. L.
    Ting, Hing-Fung
    Tsin, Yung H.
    Zhang, Yong
    DISCRETE APPLIED MATHEMATICS, 2023, 325 : 152 - 171
  • [49] A linear-time algorithm for 7-coloring 1-plane graphs
    Chen, ZZ
    Kouno, M
    ALGORITHMICA, 2005, 43 (03) : 147 - 177
  • [50] A linear-time algorithm to find independent spanning trees in maximal planar graphs
    Nagai, S.
    Nakano, S.-I.
    IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2001, E84-A (05) : 1102 - 1109
12345