Strong-mixed searching and pathwidth

Strong-mixed searching and pathwidth

0.00 Avg rating0 Votes
Article ID: iaor20072292
Country: Netherlands
Volume: 13
Issue: 1
Start Page Number: 47
End Page Number: 59
Publication Date: Jan 2007
Journal: Journal of Combinatorial Optimization
Authors:
Keywords: game theory
Abstract:

In this paper, we propose a new search model, called strong-mixed search, which is a generalization of the mixed search. We show that the strong-mixed search number of a graph equals the pathwidth of the graph. We also describe relationships between the strong-mixed search number and other search numbers.

Reviews

Required fields are marked *. Your email address will not be published.