CS-660 Graph Algorithms

  • Pre CS-600
  • Pre MA-502

    Introduction

    Basic graph-theoretic notions; data structures for graph representation; running time analysis; review of depth-first search, breadth-first search, and minimum spanning trees; network flow problems; graph connectivity; matchings; Eulerian graphs and digraphs; de Bruijn graphs; Hamiltonian graphs; traveling salesman problem; planar graphs; planarity testing; vertex and edge colorings; chromatic polynomials; five-coloring algorithm; and the Four-color problem.

Teacher

David Pfeffer
ADJUNCT PROFESSOR


Email: dpfeffer@stevens.edu

Education

Bachelors of Science in Computer Science
Stevens Institute of Technology
Hoboken, NJ
Honors; Minor in Law and Public Policy
Masters of Science in Computer Science
Stevens Institute of Technology
Hoboken, NJ
4.0 GPA; Graduate Certificates in Computer Systems, Databases & Service Oriented Architecture, Distributed Systems, Enterprise Computing, Quantitative Software Engineering, Service Oriented Computing
Professional Societies
Member of the IEEE Computer Society and ACM.
Courses
CS 521 TCP/IP Networking
CS 570 Introduction to Programming, Data Structures, and Algorithms
CS 465 Selected Topics in Computer Science
SSW 810 Selected Topics in Systems Centric Software Engineering

文章目錄
  1. 1. Introduction
  2. 2. Teacher
  3. 3. Education
,