论文信息 - The Vertex Separation Number of a Graph equals its Path-Width

The Vertex Separation Number of a Graph equals its Path-Width

Abstract We show that the problems of finding a graph's vertex separation number and path-width are the same. The equivalence of these problems with the gate matrix layout and the node search number problems then follows immediately from the results of Fellows and Langston and Kirousis and Papadimitriou, respectively. The fixed parameter variants of problems are known to possess O( n 2 ) decision algorithms based on finite but unknown obstruction sets. We show how all tree obstructions in these sets may be constructively obtained.

Nancy G. Kinnersley | N. Kinnersley

[1] P. Seymour,et al. Surveys in combinatorics 1985: Graph minors – a survey , 1985 .

[2] T. D. Parsons,et al. Pursuit-evasion in a graph , 1978 .

[3] Michael R. Fellows,et al. Nonconstructive Advances in Polynomial-Time Complexity , 1987, Inf. Process. Lett..

[4] Michael R. Fellows,et al. On search decision and the efficiency of polynomial-time algorithms , 1989, STOC '89.

[5] Jonathan S. Turner,et al. GRAPH SEPARATION AND SEARCH NUMBER. , 1987 .

[6] M. A. Langston,et al. Obstruction set isolation for layout permutation problems , 1989 .

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

[8] Neil Robertson,et al. Disjoint Paths—A Survey , 1985 .

[9] Michael R. Fellows,et al. Nonconstructive tools for proving polynomial-time decidability , 1988, JACM.

[10] Christos H. Papadimitriou,et al. Interval graphs and seatching , 1985, Discret. Math..

[11] Andrea S. LaPaugh,et al. Recontamination does not help to search a graph , 1993, JACM.

[12] Michael A. Langston,et al. Exact and Approximate Solutions for the Gate Matrix Layout Problem , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.