Algorithms Seminar/Spring10

From ResearchWiki

(Difference between revisions)
Jump to: navigation, search
m (Schedule)
(Schedule)
Line 54: Line 54:
| colspan="4" bgcolor="#dddddd" style = "text-align:center" | '''Spectral Graph Theory'''  
| colspan="4" bgcolor="#dddddd" style = "text-align:center" | '''Spectral Graph Theory'''  
|-
|-
-
| Feb 24 || Spectral properties of graphs: Laplacian and connectivity|| ||
+
| Feb 24 || Spectral properties of graphs: Laplacian and connectivity|| || Jiarong
|-  
|-  
| Mar 3 || Second eigenvalue and cuts. Cheeger's inequality|| ||
| Mar 3 || Second eigenvalue and cuts. Cheeger's inequality|| ||

Revision as of 22:21, 13 January 2010

Topics in Graph Algorithms

Wed 3:40-5:00 MEB 3105

Contents

Outline

Participants

Schedule

Date Topic Paper(s) Presenter
Planarity, Treewidth and Minors
Jan 13 Planar graphs and separators Lipton-Tarjan separator theorem, Gary Miller's cycle separator Suresh (notes)
Jan 27 Applications of Separators: MIS, Baker
Feb 3 Treewidth: defns, results, applications Erickson notes Parasaran
Feb 10 Minors. well-quasi orders, kruskal, wagner, robertson-seymour. Erickson notes Suresh
Feb 17 Diameter-treewidth: graphs of bounded treewidth exclude planar graphs. bidimensionality. Ruihong
Spectral Graph Theory
Feb 24 Spectral properties of graphs: Laplacian and connectivity Jiarong
Mar 3 Second eigenvalue and cuts. Cheeger's inequality
Mar 10 Separators via spectral properties
Mar 17 Spectral Sparsification
Mar 31
Apr 7
Apr 14
Apr 21
Apr 28
May 5?

Reading Dumplist

Personal tools