BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Drupal iCal API//EN
X-WR-CALNAME:Events items teaser
X-WR-TIMEZONE:America/Toronto
BEGIN:VTIMEZONE
TZID:America/Toronto
X-LIC-LOCATION:America/Toronto
BEGIN:DAYLIGHT
TZNAME:EDT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
DTSTART:20180311T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20181104T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69db86802c731
DTSTART;TZID=America/Toronto:20181119T103000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20181119T103000
URL:https://uwaterloo.ca/data-systems-group/events/dsg-seminar-series-hiera
 rchical-dense-subgraph-discovery
LOCATION:DC - William G. Davis Computer Research Centre 200 University Aven
 ue West Waterloo ON N2L 3G1 Canada
SUMMARY:DSG Seminar Series • Hierarchical Dense Subgraph Discovery: Model
 s\,\nAlgorithms\, Applications
CLASS:PUBLIC
DESCRIPTION:A. Erdem Sarıyüce [http://sariyuce.com]\, University at Buffa
 lo\n\nABSTRACT: Finding dense substructures in a network is a fundamental\
 ngraph mining operation\, with applications in bioinformatics\, social\nne
 tworks\, and visualization to name a few. Yet most standard\nformulations 
 of this problem (like clique\, quasi-clique\, densest\nat-least-k subgraph
 ) are NP-hard. Furthermore\, the goal is rarely to\nfind the “true optim
 um” but to identify many (if not all) dense\nsubstructures\, understand 
 their distribution in the graph\, and ideally\ndetermine relationships amo
 ng them. In this talk\, I will talk about a\nframework that we designed to
  find dense regions of the graph with\nhierarchical relations.
DTSTAMP:20260412T114816Z
END:VEVENT
END:VCALENDAR