Personal tools
You are here: Home Events Lab Lunch by Wenfei Fan

Lab Lunch by Wenfei Fan

— filed under:

Querying Big Graphs: Theory and Practice

  • Upcoming events
When Mar 10, 2014
from 01:50 PM to 01:50 PM
Add event to calendar vCal

      (a talk to be given at GDM 2014)

Graph pattern matching is being widely used in social network analysis, among other things. It is, however, cost prohibitive on real-life social graphs such as Facebook: its complexity ranges from quadratic-time to intractable, while a linear-time algorithm may take days or even years on a big graph. This talk aims to provide an overview of recent advances in making pattern matching feasible on real-life graphs, by making big graphs small, relaxing the semantics of graph pattern matching, and by proposing resource-bounded approximation.

Document Actions