LIFO-search on digraphs: A searching game for cycle-rank

Details LIFO-search on digraphs: A searching game for cycle-rank LIFO-search on digraphs: A searching game for cycle-rank

2011-03-30

arxiv.org/abs/1103.6019v2

Computer Science

Discrete Mathematics

14 pages

Scientific paper

We consider the extension of the last-in-first-out graph searching game of Giannopoulou and Thilikos to digraphs. We show that all common variations of the game require the same number of searchers, and the minimal number of searchers required is one more than the cycle-rank of the digraph. We also obtain a tight duality theorem, giving a precise min-max characterization of obstructions for cycle-rank.

Affiliated with

Also associated with

No associations

Rating

LIFO-search on digraphs: A searching game for cycle-rank does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with LIFO-search on digraphs: A searching game for cycle-rank, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and LIFO-search on digraphs: A searching game for cycle-rank will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-569908