Locally connected spanning trees in strongly chordal graphs and proper circular-arc graphs

被引:4
|
作者
Lin, Ching-Chi
Chang, Gerard J. [1 ]
Chen, Gen-Huey
机构
[1] Natl Taiwan Univ, Dept Math, Taipei 10617, Taiwan
[2] Natl Taiwan Univ, Dept Comp Sci & Informat Engn, Taipei 10617, Taiwan
关键词
algorithm; circular-arc graph; directed path graph; interval graph; locally connected spanning tree; proper circular-arc graph; strongly chordal graph;
D O I
10.1016/j.disc.2006.06.026
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
A locally connected spanning tree of a graph G is a spanning tree T of G such that the set of all neighbors of v in T induces a connected subgraph of G for every v is an element of V(G). The purpose of this paper is to give linear-time algorithms for finding locally connected spanning trees on strongly chordal graphs and proper circular-arc graphs, respectively. (c) 2006 Elsevier B.V. All rights reserved.
引用
收藏
页码:208 / 215
页数:8
相关论文
共 50 条
  • [31] Power Domination in Circular-Arc Graphs
    Liao, Chung-Shou
    Lee, D. T.
    ALGORITHMICA, 2013, 65 (02) : 443 - 466
  • [32] NC ALGORITHMS FOR CIRCULAR-ARC GRAPHS
    CHEN, L
    LECTURE NOTES IN COMPUTER SCIENCE, 1989, 382 : 291 - 302
  • [33] INDEPENDENT SETS IN CIRCULAR-ARC GRAPHS
    HSU, WL
    SPINRAD, JP
    JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 1995, 19 (02): : 145 - 160
  • [34] The clique operator on circular-arc graphs
    Lin, Min Chih
    Soulignac, Francisco J.
    Szwarcfiter, Jayme L.
    DISCRETE APPLIED MATHEMATICS, 2010, 158 (12) : 1259 - 1267
  • [35] Recognition of perfect circular-arc graphs
    Cameron, Kathie
    Eschen, Elaine A.
    Hoang, Chinh T.
    Sritharan, R.
    GRAPH THEORY IN PARIS: PROCEEDINGS OF A CONFERENCE IN MEMORY OF CALUDE BERGE, 2007, : 97 - +
  • [36] Partial Characterizations of Circular-Arc Graphs
    Bonomo, F.
    Duran, G.
    Grippo, L. N.
    Safe, M. D.
    JOURNAL OF GRAPH THEORY, 2009, 61 (04) : 289 - 306
  • [37] EFFICIENT TEST FOR CIRCULAR-ARC GRAPHS
    TUCKER, A
    SIAM JOURNAL ON COMPUTING, 1980, 9 (01) : 1 - 24
  • [38] PARALLEL ALGORITHMS ON CIRCULAR-ARC GRAPHS
    BERTOSSI, AA
    MORETTI, S
    INFORMATION PROCESSING LETTERS, 1990, 33 (06) : 275 - 281
  • [39] MATRIX CHARACTERIZATIONS OF CIRCULAR-ARC GRAPHS
    TUCKER, A
    PACIFIC JOURNAL OF MATHEMATICS, 1971, 39 (02) : 535 - &
  • [40] On the hyperbolicity constant of circular-arc graphs
    Reyes, Rosalio
    Rodriguez, Jose M.
    Sigarreta, Jose M.
    Villeta, Maria
    DISCRETE APPLIED MATHEMATICS, 2019, 263 : 244 - 256