Algorithms Seminar/Spring10
From ResearchWiki
(Difference between revisions)
(→Reading Dumplist) |
|||
| Line 89: | Line 89: | ||
** [http://arxiv.org/abs/0808.4134 spectral sparsification] | ** [http://arxiv.org/abs/0808.4134 spectral sparsification] | ||
* evasiveness | * evasiveness | ||
| + | ** '''Hot off the presses''': [http://arxiv.org/abs/1001.4829 Evasiveness and the Distribution of Prime Numbers] | ||
Revision as of 03:50, 28 January 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 | 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
