Tree 3-spanners on interval, permutation and regular bipartite graphs

被引：40
|
作者：
Madanlal, MS [1 ]
Venkatesan, G [1 ]
Rangan, CP [1 ]
机构：
[1] INDIAN INST TECHNOL,DEPT COMP SCI & ENGN,MADRAS 600036,TAMIL NADU,INDIA
来源：
INFORMATION PROCESSING LETTERS | 1996年 / 59卷 / 02期
关键词：
tree t-spanner; interval graph; permutation graph; regular bipartite graph;
D O I：
10.1016/0020-0190(96)00078-6
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
The tree 3-spanner problem consists of finding a tree 3-spanner of a given graph G(V, E). We study the tree 3-spanner problem for some special classes of graphs namely interval graphs, permutation graphs and regular bipartite graphs.
引用
收藏
页码：97 / 102
页数：6
相关论文
共 50 条
  • [41] Tree spanners, Cayley graphs, and diametrically uniform graphs
    Manuel, P
    Rajan, L
    Rajasingh, I
    Alaguvel, A
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2003, 2880 : 334 - 345
  • [42] On interval Δ-coloring of bipartite graphs
    Magomedov, A. M.
    AUTOMATION AND REMOTE CONTROL, 2015, 76 (01) : 80 - 87
  • [43] L(2, 1)-Labeling of Permutation and Bipartite Permutation Graphs
    Paul S.
    Pal M.
    Pal A.
    Mathematics in Computer Science, 2015, 9 (1) : 113 - 123
  • [44] On interval Δ-coloring of bipartite graphs
    A. M. Magomedov
    Automation and Remote Control, 2015, 76 : 80 - 87
  • [45] On the strong chromatic index and maximum induced matching of tree-cographs, permutation graphs and chordal bipartite graphs
    Kloks, Ton
    Poon, Sheung-Hung
    Ung, Chin-Ting
    Wang, Yue-Li
    JOURNAL OF DISCRETE ALGORITHMS, 2015, 30 : 21 - 28
  • [46] Random Generation and Enumeration of Bipartite Permutation Graphs
    Saitoh, Toshiki
    Otachi, Yota
    Yamanaka, Katsuhisa
    Uehara, Ryuhei
    ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2009, 5878 : 1104 - +
  • [47] Spanners for bounded tree-length graphs
    Dourisboure, Yon
    Dragan, Feodor F.
    Gavoille, Cyril
    Yan, Chenyu
    THEORETICAL COMPUTER SCIENCE, 2007, 383 (01) : 34 - 44
  • [48] Collective Tree Spanners in Graphs with Bounded Parameters
    Dragan, Feodor F.
    Yan, Chenyu
    ALGORITHMICA, 2010, 57 (01) : 22 - 43
  • [49] Bandwidth of bipartite permutation graphs in polynomial time
    Heggernes, Pinar
    Kratsch, Dieter
    Meister, Daniel
    LATIN 2008: THEORETICAL INFORMATICS, 2008, 4957 : 216 - +
  • [50] Tenacity and Rupture Degree of Permutation Graphs of Complete Bipartite Graphs
    Li, Fengwei
    Ye, Qingfang
    Li, Xueliang
    BULLETIN OF THE MALAYSIAN MATHEMATICAL SCIENCES SOCIETY, 2011, 34 (03) : 423 - 434
12345