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 条
  • [31] A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs
    Wang, Weifan
    Huang, Danjun
    Wang, Yanwen
    Wang, Yiqiao
    Du, Ding-Zhu
    JOURNAL OF GLOBAL OPTIMIZATION, 2016, 65 (02) : 351 - 367
  • [32] A Polynomial-Time Algorithm for Computing the Maximum Common Subgraph of Outerplanar Graphs of Bounded Degree
    Akutsu, Tatsuya
    Tamura, Takeyuki
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2012, 2012, 7464 : 76 - 87
  • [33] The first approximated distributed algorithm for the Minimum Degree Spanning Tree problem on general graphs
    Blin, L
    Butelle, F
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2004, 15 (03) : 507 - 516
  • [34] A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs
    Weifan Wang
    Danjun Huang
    Yanwen Wang
    Yiqiao Wang
    Ding-Zhu Du
    Journal of Global Optimization, 2016, 65 : 351 - 367
  • [35] A polynomial-time maximum common subgraph algorithm for outerplanar graphs and its application to chemoinformatics
    Leander Schietgat
    Jan Ramon
    Maurice Bruynooghe
    Annals of Mathematics and Artificial Intelligence, 2013, 69 : 343 - 376
  • [36] A polynomial-time maximum common subgraph algorithm for outerplanar graphs and its application to chemoinformatics
    Schietgat, Leander
    Ramon, Jan
    Bruynooghe, Maurice
    ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 2013, 69 (04) : 343 - 376
  • [37] Simulated Annealing is a Polynomial-Time Approximation Scheme for the Minimum Spanning Tree Problem
    Benjamin Doerr
    Amirhossein Rajabi
    Carsten Witt
    Algorithmica, 2024, 86 : 64 - 89
  • [38] Simulated Annealing is a Polynomial-Time Approximation Scheme for the Minimum Spanning Tree Problem
    Doerr, Benjamin
    Rajabi, Amirhossein
    Witt, Carsten
    ALGORITHMICA, 2024, 86 (01) : 64 - 89
  • [39] The Minimum Stretch Spanning Tree Problem for Typical Graphs
    Lan LIN
    Yi-xun LIN
    Acta Mathematicae Applicatae Sinica, 2021, 37 (03) : 510 - 522
  • [40] Simulated Annealing is a Polynomial-Time Approximation Scheme for the Minimum Spanning Tree Problem
    Doerr, Benjamin
    Rajabi, Amirhossein
    Witt, Carsten
    PROCEEDINGS OF THE 2022 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE (GECCO'22), 2022, : 1381 - 1389
12345