Solving the Single Step Graph Searching Problem by Solving the Maximum Two-Independent Set Problem

Abstract The problem of single step searching a graph is investigated. We show that this problem can be solved by solving the maximum two-independent set problem. Results about solving the single step graph searching problem on special graphs are listed.

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

[2]  Majid Sarrafzadeh,et al.  An optimal algorithm for the maximum two-chain problem , 1990, SODA '90.

[3]  Ruay-Shiung Chang.  Single Step Graph Search Problem , 1991, Inf. Process. Lett..

[4]  Mihalis Yannakakis,et al.  The Maximum k-Colorable Subgraph Problem for Chordal Graphs , 1987, Inf. Process. Lett..

[5]  Ron Y. Pinter,et al.  Trapezoid graphs and their coloring , 1988, Discret. Appl. Math..

[6]  András Frank,et al.  On chain and antichain families of a partially ordered set , 1980, J. Comb. Theory, Ser. B.

[7]  Majid Sarrafzadeh,et al.  A new approach to topological via minimization , 1989, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..