Detailed Course Information

Select the desired Level or Schedule Type to find available classes for the course.

CS 890CP - Searching Networks
In this course, we will study state-of-the-art methods for computing the optimal search stragegies for networks under different models, including basic pursuit-evasion (BPE), combinatorial sweep, monotomic sweep, connected sweep and others. 3.000 Credit hours 0.000 TO 3.000 Lecture hours 0.000 TO 3.000 Other hours Levels: Graduate Schedule Types: Lecture, Report, Independent Study, Directed Reading, Examination Computer Science Department Restrictions: Must be enrolled in one of the following Levels: Graduate

CS 890CP - Searching Networks

In this course, we will study state-of-the-art methods for computing the optimal search stragegies for networks under different models, including basic pursuit-evasion (BPE), combinatorial sweep, monotomic sweep, connected sweep and others.
3.000 Credit hours
0.000 TO 3.000 Lecture hours
0.000 TO 3.000 Other hours

Levels: Graduate
Schedule Types: Lecture, Report, Independent Study, Directed Reading, Examination

Computer Science Department

Restrictions:
Must be enrolled in one of the following Levels:
Graduate

Return to Previous	New Search

Return to Previous

New Search

Skip to top of page

UR Self-Service

Detailed Course Information

© 2025 Ellucian Company L.P. and its affiliates.