CS 6824: Hypergraph Algorithms and Applications

T. M. Murali

Spring 2014, 4:00pm-5:15pm, Mondays and Wednesdays, Randolph 320

Schedule (subject to change throughout the semester)
Note that links in the "Topic and papers" column point to specific papers assigned for each class.
Date Topic and papers Presenter(s) (links point to the presentations)
Wed, Jan 22, 2014 Introduction to Hypergraphs T. M. Murali
Mon, Jan 27, 2014 Short presentations on hypergraph-related papers All students
Wed, Jan 29, 2014 Short presentations on hypergraph-related papers (contd.) All students, same presentation as the previous class
Mon, Feb 3, 2014 Review of graph algorithms (shortest paths, spanning trees) T. M. Murali
Wed, Feb 5, 2014 Review of graph algorithms (spanning trees, Steiner trees) T. M. Murali, same lecture as the previous class
Mon, Feb 10, 2014 Review of graph algorithms (Steiner trees continued) T. M. Murali, same lecture as the previous class
Wed, Feb 12, 2014 Class cancelled by university
Mon, Feb 17, 2014 Course Papers and Projects T. M. Murali
Wed, Feb 19, 2014 Class cancelled
Mon, Feb 24, 2014 Class cancelled
Wed, Feb 26, 2014 Review of graph algorithms (Flows and cuts) T. M. Murali
Mon, Mar 3, 2014 Review of graph algorithms (Flows and cuts)
Signaling Hypergraphs: A New Representation for Biological Signaling Pathways
T. M. Murali, same lecture as the previous class
Anna Ritz
Wed, Mar 5, 2014 Signaling Hypergraphs Anna Ritz, same lecture as the previous class
Student presentations
Mon, Mar 17, 2014 Review of NP-completeness T. M. Murali
Wed, Mar 19, 2014 Optimal Traversal of Directed Hypergraphs Michael Levet
Mon, Mar 24, 2014 Linear connectivity problems in directed hypergraphs
Directed hypergraphs and applications
Brendan Avent and Nitin Passa
Wed, Mar 26, 2014 Directed hypergraphs and applications Brendan Avent and Nitin Passa, same presentation as the previous class
Mon, Mar 31, 2014 Finding the K Shortest Loopless Paths in a Network
Finding the K shortest hyperpaths
Finding the K shortest hyperpaths using reoptimization
T. M. Murali
Jose Cadena
Wed, Apr 2, 2014 Finding the K shortest hyperpaths
Finding the K shortest hyperpaths using reoptimization
Jose Cadena, same presentation as the previous class
Mon, Apr 7, 2014 A Note on Menger's Theorem for Hypergraphs Alexander Friedman
Wed, Apr 9, 2014 A Note on Menger's Theorem for Hypergraphs Alexander Friedman, same presentation as the previous class
Mon, Apr 14, 2014 Flows on hypergraphs Matthew Dallmeyer and Mohammed Davoodi
Wed, Apr 16, 2014 Matthew Dallmeyer and Mohammed Davoodi, same presentatin as the previous class
Mon, Apr 21, 2014 Class cancelled
Wed, Apr 23, 2014 Multilevel hypergraph partitioning: applications in VLSI domain Doaa Altarawy
Mon, Apr 28, 2014 Normalized cuts and image segmentation
Learning with hypergraphs: Clustering, classification, and embedding
Yeser Keneshloo
Wed, Apr 30, 2014 Learning with hypergraphs: Clustering, classification, and embedding Yeser Keneshloo, same presentation as the previous class
Mon, May 5, 2014 Random walks in directed hypergraphs and application to semi-supervised image segmentation Antuan Bualik and Tyler Kahn
Wed, May 7, 2014
Random walks in directed hypergraphs and application to semi-supervised image segmentation Antuan Bualik and Tyler Kahn, same presentation as the previous class

About the Course

Last modified: Thu Jan 31 13:19:59 EST 2014