Go to Main Content

Brown University

 

HELP | EXIT

Catalog Entries

 

Spring 2017
Oct 16, 2019
Transparent Image
  Select the Course Number to get further detail on the course. Select the desired Schedule Type to find available classes for the course.

CSCI 2500B - Optimization Algorithms for Planar Graphs
Planar graphs arise in applications such as road map navigation and logistics, graph drawing and image processing. We will study graph algorithms and data structures that exploit planarity. Our focus will be on recent research results in optimization. Prerequisite: CSCI 1570 or the equivalent.
1.000 Credit hours
1.000 Lecture hours

Levels: Graduate, Undergraduate
Schedule Types: Primary Meeting

Computer Science Department


Return to Previous New Search XML Extract
Transparent Image
Skip to top of page
Release: 8.7.2.4