Tata Institute of Fundamental Research

Graph Drawing with no k Pairwise Crossing Edges

Student Seminar
Speaker: Saswata Shannigrahi School of Technology and Computer Science Tata Institute of Fundamental Research Homi Bhabha R
Date: Wednesday, 26 Aug 2009 (all day)
Venue: A-212 (STCS Seminar Room)

(Scan to add to calendar)
Abstract:  We will try to find an upper bound on the number of edges in a graph with no k pairwise crossing edges.