A polynomial time algorithm for obtaining a minimum vertex ranking spanning tree in outerplanar graphs

被引：2
|
作者：
Nakayama, Shin-ichi [1 ]
Masuyama, Shigeru
机构：
[1] Univ Tokushima, Fac Integrated Arts & Sci, Dept Math Sci, Tokushima 7708502, Japan
[2] Toyohashi Univ Technol, Dept Knowledge Based Informat Engn, Toyohashi, Aichi 4418580, Japan
来源：
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS | 2006年 / E89D卷 / 08期
关键词：
algorithm; vertex ranking; spanning tree; outerplanar graph;
D O I：
10.1093/ietisy/e89-d.8.2357
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
The minimum vertex ranking spanning tree problem is to find a spanning tree of G whose vertex ranking is minimum. This problem is NP-hard and no polynomial time algorithm for solving it is known for non-trivial classes of graphs other than the class of interval graphs. This paper proposes a polynomial time algorithm for solving the minimum vertex ranking spanning tree problem on outerplanar graphs.
引用
收藏
页码：2357 / 2363
页数：7
相关论文
共 50 条
  • [1] A polynomial time algorithm for obtaining minimum edge ranking on two-connected outerplanar graphs
    Nakayama, Shin-ichi
    Masuyama, Shigeru
    INFORMATION PROCESSING LETTERS, 2007, 103 (06) : 216 - 221
  • [2] An algorithm for solving the minimum vertex ranking spanning tree problem on interval graphs
    Nakayama, SI
    Masuyama, S
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2003, E86A (05): : 1019 - 1026
  • [3] An Algorithm for Solving the Minimum Vertex Ranking Spanning Tree Problem on Interval Graphs
    Nakayama, Shin-Ichi
    Masuyama, Shigeru
    IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2003, E86-A (05) : 1019 - 1026
  • [4] Minimum Vertex Ranking Spanning Tree Problem on Permutation Graphs
    Chang, Ruei-Yuan
    Lee, Guanling
    Peng, Sheng-Lung
    THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, 2009, 5532 : 158 - 167
  • [5] Minimum Vertex Ranking Spanning Tree Problem on Some Classes of Graphs
    Chang, Ruei-Yuan
    Lee, Guanling
    Peng, Sheng-Lung
    ADVANCED INTELLIGENT COMPUTING THEORIES AND APPLICATIONS, PROCEEDINGS: WITH ASPECTS OF ARTIFICIAL INTELLIGENCE, 2008, 5227 : 758 - 765
  • [6] An algorithm for solving the minimum vertex-ranking spanning tree problem on series-parallel graphs
    Kashem, Md. Abul
    Hasan, Chowdhury Sharif
    Bhattacharjee, Anupam
    ICECE 2006: PROCEEDINGS OF THE 4TH INTERNATIONAL CONFERENCE ON ELECTRICAL AND COMPUTER ENGINEERING, 2006, : 328 - +
  • [7] Polynomial time algorithm for computing a minimum geodetic set in outerplanar graphs
    Mezzini, Mauro
    THEORETICAL COMPUTER SCIENCE, 2018, 745 : 63 - 74
  • [8] Minimum spanning tree cycle intersection problem on outerplanar graphs
    Su, Tai -Yu
    DISCRETE APPLIED MATHEMATICS, 2024, 343 : 328 - 339
  • [9] A Linear Time Algorithm for Finding a Minimum Spanning Tree with Non-Terminal Set VNT on Outerplanar Graphs
    Nakayama, Shin-ichi
    Masuyama, Shigeru
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2017, E100D (03) : 434 - 443
  • [10] Np-hardness proof and an approximation algorithm for the minimum vertex ranking spanning tree problem
    Miyata, Keizo
    Masuyama, Shigeru
    Nakayama, Shin-ichi
    Zhao, Liang
    DISCRETE APPLIED MATHEMATICS, 2006, 154 (16) : 2402 - 2410
12345