By Topic

An Algorithm for Solving the Minimum Vertex-Ranking Spanning Tree Problem on Series-Parallel Graphs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Md. Abul Kashem ; Department of Computer Science and Engineering, Bangladesh University of Engineering and Technology, Dhaka 1000, Bangladesh. kashem@cse.buet.ac.bd ; Chowdhury Sharif Hasan ; Anupam Bhattacharjee

A vertex-ranking of a graph G is a labeling of the vertices of G with positive integers such that every path between two vertices with the same label i contains a vertex with label j > i. The minimum vertex-ranking spanning tree problem is to find a spanning tree of a graph G whose vertex-ranking needs least number of labels. In this paper, we present an algorithm to solve the minimum vertex-ranking spanning tree problem on a series-parallel graph G in O(n5 log4 n) time, where n is the number of vertices in G.

Published in:

2006 International Conference on Electrical and Computer Engineering

Date of Conference:

19-21 Dec. 2006