M. Tamer Özsu

activity

20152026

most citedG-thinker: Big Graph Mining Made Easier and Faster

16 citations · 28 across the 8 of their papers we have counts for

collaborators

Showing 2020Show all

2 papers · 1 filter

cs.DC2020

Scalable Mining of Maximal Quasi-Cliques: An Algorithm-System Codesign Approach

Guimu Guo, Da Yan, M. Tamer Özsu +2

Given a user-specified minimum degree threshold $γ$ , a $γ$ -quasi-clique is a subgraph $g = (V_{g}, E_{g})$ where each vertex $v \in V_{g}$ connects to at least $γ$ fraction of the other vert…

cs.DB2020

Regular Path Query Evaluation on Streaming Graphs

Anil Pacaci, Angela Bonifati, M. Tamer Özsu

We study persistent query evaluation over streaming graphs, which is becoming increasingly important. We focus on navigational queries that determine if there exists a path between…