论文信息 - On the vertex separation of unicyclic graphs

On the vertex separation of unicyclic graphs

In the article “Computing the vertex separation of unicyclic graphs”, Information and Computation 192, pp. 123–161, 2004, Ellis et al. proposed an O(n log n) algorithm for computing both the vertex separation and an optimal layout of a unicyclic graph with n vertices. Using the data structures label and label array, we improve the time complexity of their algorithm to O(n).

Hsin-Hung Chou

[1] Ton Kloks,et al. Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs , 1993, J. Algorithms.

[2] Rolf H. Möhring,et al. The Pathwidth and Treewidth of Cographs , 1993, SIAM J. Discret. Math..

[3] Rolf H. Möhring,et al. Graph Problems Related to Gate Matrix Layout and PLA Folding , 1990 .

[4] Ivan Hal Sudborough,et al. The Vertex Separation and Search Number of a Graph , 1994, Inf. Comput..

[5] John A. Ellis,et al. Computing the vertex separation of unicyclic graphs , 2004, Inf. Comput..

[6] Konstantin Skodinis. Construction of linear tree-layouts which are optimal with respect to vertex separation in linear time , 2003, J. Algorithms.

[7] Chuan Yi Tang,et al. Graph Searching on Some Subclasses of Chordal Graphs , 2000, Algorithmica.

[8] Paul D. Seymour,et al. Graph minors. I. Excluding a forest , 1983, J. Comb. Theory, Ser. B.

[9] Dieter Kratsch,et al. Treewidth and Pathwidth of Permutation Graphs , 1993, ICALP.

[10] Christos H. Papadimitriou,et al. Searching and Pebbling , 1986, Theor. Comput. Sci..