Abstract

: In this paper, we propose a linear time algorithm for finding a minimum spanning tree on a planar graph. Keywords: Combinatorial problems; graphs; spanning trees; planar graphs 1 Introduction Finding a spanning tree of minimum weight is one of the best known graph problems. Several efficient algorithms exist for solving this problem [1, 3, 4, 5, 6, 9, 11, 13]. This paper presents a liner time algorithm for the minimum spanning tree problem on a planar graph. In [1], Cheriton and Tarjan have proposed a linear time algorithm for this problem. The time complexity of our algorithm is the same as that of Cheriton and Tarjan's algorithm. Different from Cheriton and Tarjan's algorithm, our algorithm does not require the clean-up activity. So, the implementation of our algorithm is very easy. Our algorithm maintains a pair of a planar graph and its dual graph and breeds both a minimum spanning tree of original graph and a maximum spanning tree of a dual graph. In each iteration of our algor...

Citations