论文信息 - An optimal algorithm for finding biconnected components in permutation graphs - 字舞流文

An optimal algorithm for finding biconnected components in permutation graphs

We present an 0 (n) time algorithm for jinding biconnected components in permutation graphs. The best known algorithm for this problem takes 0 (m + n) time in a general gruph of n vertices und m edges.

Y. Daniel Liang | Chongkye Rhee | Y. Liang | C. Rhee

[1] A. Lempel,et al. Transitive Orientation of Graphs and Identification of Permutation Graphs , 1971, Canadian Journal of Mathematics.

[2] Martin Farber,et al. Domination in Permutation Graphs , 1985, J. Algorithms.

[3] Jeremy P. Spinrad,et al. On Comparability and Permutation Graphs , 1985, SIAM J. Comput..

[4] J. Keil,et al. Finding minimum dominating cycles in permutation graphs , 1985 .

[5] R. Möhring. Algorithmic graph theory and perfect graphs , 1986 .

[6] Dieter Kratsch,et al. On Domination Problems for Permutation and Other Graphs , 1987, Theor. Comput. Sci..

[7] Mikhail J. Atallah,et al. Finding a minimum independent dominating set in a permutation graph , 1988, Discret. Appl. Math..

[8] S. Lakshmivarahan,et al. A New Approach for the Domination Problem on Permutation Graphs , 1991, Inf. Process. Lett..

[9] Dorit S. Hochbaum,et al. Why Should Biconnected Components be Identified First , 1993, Discret. Appl. Math..

[10] S. Lakshmivarahan,et al. Efficient Algorithms for Finding Depth-First and Breadth-First Search Trees in Permutation Graphs , 1994, Inf. Process. Lett..

[11] S. Lakshmivarahan,et al. An O(N+M)-Time Algorithm for Finding a Minimum-Weight Dominating Set in a Permutation Graph , 1996, SIAM J. Comput..