论文信息 - An optimal algorithm for finding depth-first spanning tree on permutation graphs

An optimal algorithm for finding depth-first spanning tree on permutation graphs

LetG be a connected graph ofn vertices. The problem of finding a depth-first spanning tree ofG is to find a connected subgraph ofG with then vertices andn − 1 edges by depth-first-search. In this paper, we propose anO(n) time algorithm to solve this problem on permutation graphs.

Madhumangal Pal | Sukumar Mondal | Tapan Kumar Pal

[1] S. Sitharama Iyengar,et al. An Efficient Distributed Depth-First-Search Algorithm , 1989, Inf. Process. Lett..

[2] Amir Pnueli,et al. Permutation Graphs and Transitive Graphs , 1972, JACM.

[3] S. Lakshmivarahan,et al. NC algorithms for finding depth-first-search trees in interval graphs and circular-arc graphs , 1991, IEEE Proceedings of the SOUTHEASTCON '91.

[4] H. Salehi Fathabadi,et al. A new algorithm for minimum spanning tree using depth-first-search in an undirected graph , 1995, Int. J. Comput. Math..

[5] Robert E. Tarjan,et al. Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

[6] M. Golumbic. Algorithmic graph theory and perfect graphs , 1980 .

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

[8] Zvi Ostfeld,et al. On the existence of special depth first search trees , 1995, J. Graph Theory.

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

[10] Gregory E. Shannon. A Linear-Processor Algorithm for Depth-First Search in Planar Graphs , 1988, Inf. Process. Lett..