Algorithms Seminar/Spring10

From ResearchWiki

Revision as of 03:49, 6 January 2010 by Moeller (Talk | contribs)
Jump to: navigation, search

Topics in Graph Algorithms

Wed 1:25-2:45 WEB 1460

Contents

Outline

  • separator structures on graphs: planarity, treewidth, and the robertson-seymour theorem
  • Spectral properties of graphs
  • evasiveness

Participants

Schedule

Reading Dumplist

Retrieved from "http://www.cs.utah.edu/~suresh/mediawiki/index.php/Algorithms_Seminar/Spring10"
Personal tools