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 条
12345