Algorithms Seminar/Spring10
From ResearchWiki
(Difference between revisions)
m |
m |
||
| Line 10: | Line 10: | ||
==Participants== | ==Participants== | ||
| + | * [http://www.cs.utah.edu/~suresh Suresh Venkatasubramanian], Assistant Professor, School of Computing | ||
| + | * [http://www.cs.utah.edu/~praman Parasaran Raman], PhD Student, School of Computing | ||
| + | * [mailto:rajvarma@cs.utah.edu Raj Varma Kommaraju], MS Student, School of Computing | ||
| + | * [mailto:avishek@cs.utah.edu Avishek Saha], PhD Student, School of Computing | ||
* [mailto:moeller@cs.utah.edu John Moeller], PhD Student, School of Computing | * [mailto:moeller@cs.utah.edu John Moeller], PhD Student, School of Computing | ||
Revision as of 03:50, 6 January 2010
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
- Suresh Venkatasubramanian, Assistant Professor, School of Computing
- Parasaran Raman, PhD Student, School of Computing
- Raj Varma Kommaraju, MS Student, School of Computing
- Avishek Saha, PhD Student, School of Computing
- John Moeller, PhD Student, School of Computing
