## A Linear Time Algorithm for the Minimum Spanning Tree Problem on a Planar Graph (1994)

### BibTeX

@MISC{Matsui94alinear,

author = {Tomomi Matsui},

title = {A Linear Time Algorithm for the Minimum Spanning Tree Problem on a Planar Graph},

year = {1994}

}

### OpenURL

### 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

1436 | A note on two problems in connexion with graphs
- Dijkstra
- 1959
(Show Context)
Citation Context ...ms; 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 compl... |

1130 |
Graph Theory
- Harary
- 1969
(Show Context)
Citation Context ...called a dual graph of G if it satisfies the condition that an edge subset C ` E is a cycle of G if and only if C is a cut-set of G 3 : If G 3 is a dual graph of G; then G is a dual graph of G 3 (see =-=[7, 10]-=- for example). It is known that a graph is planar if and only if it has a dual graph [12]. If we have a planar embedding of a graph G; it is easy to construct a dual graph of G geometrically (see [7, ... |

575 |
Fibonacci heaps and their uses in improved network optimization algorithms
- Fredman, Tarjan
- 1987
(Show Context)
Citation Context ...ms; 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 compl... |

531 |
Shortest connection networks and some generalisations
- Prim
- 1957
(Show Context)
Citation Context ...ms; 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 compl... |

436 |
On the Shortest Spanning Subtree of a Graph and the Travelling Salesman Problem
- Kruskal
- 1956
(Show Context)
Citation Context |

274 |
Combinatorial Optimization: Networks and
- LAWLER
- 1976
(Show Context)
Citation Context ...called a dual graph of G if it satisfies the condition that an edge subset C ` E is a cycle of G if and only if C is a cut-set of G 3 : If G 3 is a dual graph of G; then G is a dual graph of G 3 (see =-=[7, 10]-=- for example). It is known that a graph is planar if and only if it has a dual graph [12]. If we have a planar embedding of a graph G; it is easy to construct a dual graph of G geometrically (see [7, ... |

226 | Tarjan, Efficient planarity testing
- Hopcroft, E
- 1974
(Show Context)
Citation Context ...ple). It is known that a graph is planar if and only if it has a dual graph [12]. If we have a planar embedding of a graph G; it is easy to construct a dual graph of G geometrically (see [7, 10]). In =-=[8]-=-, Hopcroft and Tarjan proposed a linear time algorithm for embedding a planar graph in the plane. In this paper, we propose an algorithm for finding a minimum (maximum) weight spanning forest of a pla... |

90 |
On abstract properties of linear dependence
- Whitney
- 1935
(Show Context)
Citation Context ...of G if and only if C is a cut-set of G 3 : If G 3 is a dual graph of G; then G is a dual graph of G 3 (see [7, 10] for example). It is known that a graph is planar if and only if it has a dual graph =-=[12]-=-. If we have a planar embedding of a graph G; it is easy to construct a dual graph of G geometrically (see [7, 10]). In [8], Hopcroft and Tarjan proposed a linear time algorithm for embedding a planar... |

86 |
P.: On the history of the minimum spanning tree problem
- Graham, Hell
- 1985
(Show Context)
Citation Context |

83 |
Efficient algorithms for finding minimum spanning trees in nondirected and directed graphs
- Gabow, Galil, et al.
- 1986
(Show Context)
Citation Context |

67 |
Finding minimum spanning trees
- Cheriton, Tarjan
- 1976
(Show Context)
Citation Context |

6 |
An O(jEj log log jV j) algorithm for finding minimum spanning trees
- Yao
- 1975
(Show Context)
Citation Context |

1 |
Efficient algorithms for graph alterations (in Japanese
- Chiba, Nishizeki, et al.
- 1981
(Show Context)
Citation Context ... of v is less than four, we can find a minimum weight edge e in ffi G1 (v) in constant time. If we contract the edge e connecting two vertices v and u; it requires O(minfdG1 (v); d G1 (u)g) time (see =-=[2]-=- for example). Since d G1 (v) ! 4; the edge contraction procedure in Step 4 requires O(1) time. Similarly, we can show that the time complexity of Step 6 is O(1): The above discussion implies that whe... |