Algorithms Seminar/Spring10

From ResearchWiki

(Difference between revisions)
Jump to: navigation, search
(Schedule)
(Schedule)
Line 46: Line 46:
| Jan 13 || Planar graphs and separators|| [http://infolab.stanford.edu/pub/cstr/reports/cs/tr/77/627/CS-TR-77-627.pdf Lipton-Tarjan separator theorem], [http://www-2.cs.cmu.edu/~glmiller/Publications/Papers/Mi87.pdf Gary Miller's cycle separator]|| Suresh [[Talk:Algorithms_Seminar/Spring10#Jan_13|(notes)]]
| Jan 13 || Planar graphs and separators|| [http://infolab.stanford.edu/pub/cstr/reports/cs/tr/77/627/CS-TR-77-627.pdf Lipton-Tarjan separator theorem], [http://www-2.cs.cmu.edu/~glmiller/Publications/Papers/Mi87.pdf Gary Miller's cycle separator]|| Suresh [[Talk:Algorithms_Seminar/Spring10#Jan_13|(notes)]]
|-
|-
-
| Jan 27 || Applications of Separators: The MIS problem || [ftp://reports.stanford.edu/pub/cstr/reports/cs/tr/77/628/CS-TR-77-628.pdf Lipton-Tarjan], [http://faculty.cs.tamu.edu/chen/courses/cpsc669/s2003/project/baker.pdf Baker]||
+
| Jan 27 || Applications of Separators: The MIS problem || [ftp://reports.stanford.edu/pub/cstr/reports/cs/tr/77/628/CS-TR-77-628.pdf Lipton-Tarjan], [http://faculty.cs.tamu.edu/chen/courses/cpsc669/s2003/project/baker.pdf Baker]|| JT
|-
|-
| Feb 3 || Treewidth: defns, results, applications|| [http://compgeom.cs.uiuc.edu/~jeffe/teaching/comptop/notes/treewidth.pdf Erickson notes]|| Parasaran
| Feb 3 || Treewidth: defns, results, applications|| [http://compgeom.cs.uiuc.edu/~jeffe/teaching/comptop/notes/treewidth.pdf Erickson notes]|| Parasaran

Revision as of 19:58, 26 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: The MIS problem Lipton-Tarjan, Baker JT
Feb 3 Treewidth: defns, results, applications Erickson notes Parasaran
Feb 10 Minors. well-quasi orders, kruskal, wagner, robertson-seymour. well-quasi orders, Higman's lemma (Section 3), Kruskal's theorem, 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 Jags
Mar 10 Separators via spectral properties Seth
Mar 17 Spectral Sparsification John
Graph Algorithms
Mar 31 Planarity Testing
Apr 7 Randomized linear time MST Raj
Apr 14 All pairs-shortest paths
Apr 21
Evasiveness: Graphs meet topology
Apr 28
May 5?

Reading Dumplist

Personal tools