View all Seminars  |  Download ICal for this event

Finding densest sub-graphs without flow computations

Series: Department Seminar

Speaker: Mr. Saurabh Sawlani 5th year Ph.D. Student Algorithms, Combinatorics, and Optimization Program Georgia Tech

Date/Time: Jan 30 16:00:00

Location: CSA Seminar Hall (Room No. 254, First Floor)

Faculty Advisor:

Detecting dense components is a major problem in graph mining,and many different notions of a dense subgraph are used in practice. The densest subgraph problem focuses on finding a subgraph with maximum

Speaker Bio:
Saurabh Sawlani is a 5th year Ph.D. student in the Algorithms, Combinatorics, and Optimization program at Georgia Tech, advised by Dr. Richard Peng. He received his B.Tech and M.S. at IIT Madras. His research interests include randomized algorithms, graph theory, and scientific computing. About the chapter: The aim of IISc-SIAM student chapter is to encourage academic activities at IISc, such as technical talks, lecture series, workshops etc., related to areas which cooperate between mathematics, science and technology.

Host Faculty: IISc-Siam student chapter