Mixed searching and proper-path-width
A Takahashi, S Ueno, Y Kajitani - Theoretical Computer Science, 1995 - Elsevier
A Takahashi, S Ueno, Y Kajitani
Theoretical Computer Science, 1995•ElsevierThis paper considers a mixed search game, which is a natural generalization of edge-
search and node-search games extensively studied so far. We establish a relationship
between the mixed-search number of a graph G and the proper-path-width of G introduced
by the authors in a previous paper. We also prove complexity results.
search and node-search games extensively studied so far. We establish a relationship
between the mixed-search number of a graph G and the proper-path-width of G introduced
by the authors in a previous paper. We also prove complexity results.
This paper considers a mixed search game, which is a natural generalization of edge-search and node-search games extensively studied so far. We establish a relationship between the mixed-search number of a graph G and the proper-path-width of G introduced by the authors in a previous paper. We also prove complexity results.
Elsevier