Local versus Global Search in Channel Graphs

Details Local versus Global Search in Channel Graphs Local versus Global Search in Channel Graphs

2010-04-15

arxiv.org/abs/1004.2526v1

Computer Science

Computational Complexity

i+13 pages, 2 figures

Scientific paper

Previous studies of search in channel graphs has assumed that the search is global; that is, that the status of any link can be probed by the search algorithm at any time. We consider for the first time local search, for which only links to which an idle path from the source has already been established may be probed. We show that some well known channel graphs may require exponentially more probes, on the average, when search must be local than when it may be global.

Affiliated with

Also associated with

No associations

Rating

Local versus Global Search in Channel Graphs 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 Local versus Global Search in Channel Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Local versus Global Search in Channel Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-379338