Algorithms Seminar/Spring10
From ResearchWiki
(Difference between revisions)
(→Schedule) |
m (→Schedule) |
||
| Line 31: | Line 31: | ||
| 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 | | 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]. Also read Shiva Kintali's recent [http://kintali.wordpress.com/2010/01/28/approximating-treewidth/ blog post]|| Parasaran | + | | Feb 3 || Treewidth: defns, results, applications|| [http://compgeom.cs.uiuc.edu/~jeffe/teaching/comptop/notes/treewidth.pdf Erickson notes]. Also read Shiva Kintali's recent [http://kintali.wordpress.com/2010/01/28/approximating-treewidth/ blog post]. [http://www.cs.uu.nl/research/techreps/repo/CS-1992/1992-27.pdf Bodlaender'96]|| Parasaran |
|- | |- | ||
| Feb 10 || Minors. well-quasi orders, kruskal, wagner, robertson-seymour. || [http://en.wikipedia.org/wiki/Well-quasi-ordering well-quasi orders], [http://www.google.com/url?sa=t&source=web&ct=res&cd=15&ved=0CCAQFjAEOAo&url=ftp%3A%2F%2Fftp.cis.upenn.edu%2Fpub%2Fpapers%2Fgallier%2Fkruskal1.ps&ei=h6VQS5P2JYf8tQO44c32Bw&usg=AFQjCNHqsIMWSZrggRSBdOPHY-tH_QncsQ&sig2=X0fWrAhen16BpJo7nVRqww Higman's lemma (Section 3)], [http://en.wikipedia.org/wiki/Kruskal%27s_tree_theorem Kruskal's theorem], [http://compgeom.cs.uiuc.edu/~jeffe/teaching/comptop/notes/graph-minors.pdf Erickson notes]|| Suresh | | Feb 10 || Minors. well-quasi orders, kruskal, wagner, robertson-seymour. || [http://en.wikipedia.org/wiki/Well-quasi-ordering well-quasi orders], [http://www.google.com/url?sa=t&source=web&ct=res&cd=15&ved=0CCAQFjAEOAo&url=ftp%3A%2F%2Fftp.cis.upenn.edu%2Fpub%2Fpapers%2Fgallier%2Fkruskal1.ps&ei=h6VQS5P2JYf8tQO44c32Bw&usg=AFQjCNHqsIMWSZrggRSBdOPHY-tH_QncsQ&sig2=X0fWrAhen16BpJo7nVRqww Higman's lemma (Section 3)], [http://en.wikipedia.org/wiki/Kruskal%27s_tree_theorem Kruskal's theorem], [http://compgeom.cs.uiuc.edu/~jeffe/teaching/comptop/notes/graph-minors.pdf Erickson notes]|| Suresh | ||
Revision as of 21:18, 2 February 2010
Topics in Graph Algorithms
Wed 3:40-5:00 MEB 3105
Participants
- Suresh Venkatasubramanian, Assistant Professor, School of Computing
- Jeff Phillips, CI Postdoctoral Fellow, 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
- Jagadeesh Jagarlamudi, PhD Student, School of Computing
- Piyush Rai, PhD Student, School of Computing
- Ruihong Huang, PhD Student, School of Computing
- Jiarong Jiang, PhD Student, School of Computing
- JT Olds, MS Student, School of Computing
- Seth Juarez, PhD Student, School of Computing
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. Also read Shiva Kintali's recent blog post. Bodlaender'96 | 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 | JT | |
| Apr 21 | |||
| Evasiveness: Graphs meet topology | |||
| Apr 28 | |||
| May 5? | |||
Reading Dumplist
- On computing graph minor obstruction sets
- Local treewidth and approximations
- Lovasz review of graph minor theory
- MST survey
- separator structures on graphs: planarity, treewidth, and the robertson-seymour theorem
- A tourist guide through treewidth
- Application: junction trees in graphical models (2.5.2)
- Application: solving NP-hard problems on graphs of bounded treewidth.
- General algorithmic methods for solving problems on graphs of bounded treewidth
- Nice survey of Courcelle's theorem and implications.
- separators for graphs with excluded minors
- Spectral properties of graphs
- laplacian and connectivity
- second eigenvalue and cuts. Cheeger's inequality
- Spielman/Teng spectral separator theorem and related notes:
- spectral sparsification
- evasiveness
- Hot off the presses: Evasiveness and the Distribution of Prime Numbers
