Title of article
Fedor V. Fomin
Author/Authors
The problem of searching a fugitive in a graph by a team of pursuers is considered. A new criterion of optimal search called the searching expenditure is defined. It is proved that for each graph G، نويسنده , , the searching expenditure is equal to the number of edges in the least (with respect to the number of edges) interval graph containing G as a subgraph.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2004
Pages
8
From page
97
To page
104
Abstract
The problem of searching a fugitive in a graph by a team of pursuers is considered. A new criterion of optimal search called the searching expenditure is defined. It is proved that for each graph G, the searching expenditure is equal to the number of edges in the least (with respect to the number of edges) interval graph containing G as a subgraph.
Keywords
Graph , Searching
Journal title
Discrete Applied Mathematics
Serial Year
2004
Journal title
Discrete Applied Mathematics
Record number
885764
Link To Document