A Polynomial Time Algorithm for Obtaining a Minimum Vertex Ranking Spanning Tree in Outerplanar Graphs

Shin-ichi NAKAYAMA  Shigeru MASUYAMA  

Publication
IEICE TRANSACTIONS on Information and Systems   Vol.E89-D   No.8   pp.2357-2363
Publication Date: 2006/08/01
Online ISSN: 1745-1361
DOI: 10.1093/ietisy/e89-d.8.2357
Print ISSN: 0916-8532
Type of Manuscript: INVITED PAPER (Special Section on Invited Papers from New Horizons in Computing)
Category: 
Keyword: 
algorithm,  vertex ranking,  spanning tree,  outerplanar graph,  

Full Text: PDF>>
Buy this Article




Summary: 
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.