Dec 1, 2011 · We introduce the notion of shelters in graphs and we prove a min-max theorem implying their equivalence with the tree-depth parameter. As ...
We introduce a variant of the classic node search game called LIFO-search where searchers are assigned different numbers.
Abstract. We introduce a variant of the classic node search game called LIFO-search where searchers are assigned different numbers.
We introduce the notion of shelters in graphs and we prove a min-max theorem implying their equivalence with the tree-depth parameter. As shelters provide ...
We introduce a variant of the classic node search game called LIFO-search where searchers are assigned different numbers. The additional rule is that a ...
Abstract. We introduce a variant of the classic node search game called LIFO-search where searchers are assigned different numbers.
We introduce the notion of shelters in graphs and we prove a min-max theorem implying their equivalence with the tree-depth parameter. As shelters provide ...
We show that all common variations of the game require the same number of searchers. We then introduce the notion of (directed) shelters in (di)graphs and prove ...
Journal article · LIFO−search: A min−max theorem and a searching game for cycle−rank and tree−depth. · Email this record.
People also ask
What are the conditions for the min-max theorem?
What is the min-max theorem in graph theory?
The additional rule is that a searcher can be removed only if no searchers of lower rank are in the graph at that moment. We introduce the notion of shelters in ...