论文信息 - An algorithm for finding a large independent set in planar graphs

An algorithm for finding a large independent set in planar graphs

A subset of the vertices of a graph is independent if no two vertices in the set are adjacent. M. O. Albertson proposed an algorithm for finding an independent set that contains more than two-ninth of the vertices of a planar graph. Refining his algorithm, we give an O(n2) algorithm for the same purpose.

Norishige Chiba | Nobuji Saito | Takao Nishizeki

[1] Norishige Chiba,et al. A Linear 5-Coloring Algorithm of Planar Graphs , 1981, J. Algorithms.

[2] M. Albertson. Finding an independent set in a planar graph , 1974 .

[3] Robert E. Tarjan,et al. Efficient Planarity Testing , 1974, JACM.

[4] K. Appel,et al. Every planar map is four colorable. Part I: Discharging , 1977 .

[5] Michael O. Albertson,et al. A lower bound for the independence number of a planar graph , 1976 .

[6] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .