BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//project/author//NONSGML v1.0//EN
CALSCALE:GREGORIAN
BEGIN:VEVENT
DTEND:20200130T120000Z
UID:ec226bfbebf53eb17d6dde8d71ffd1a5-54
DTSTAMP:19700101T120016Z
DESCRIPTION:Finding densest sub-graphs without flow computations
URL;VALUE=URI:https://www.csa.iisc.ac.in/newweb/event/54/finding-densest-sub-graphs-without-flow-computations/
SUMMARY: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
DTSTART:20200130T120000Z
END:VEVENT
END:VCALENDAR