activity
20202026
most citedComputing Graph Descriptors on Edge Streams

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

collaborators
Showing 2020Show all

2 papers · 1 filter

cs.CC2020

A Simpler NP-Hardness Proof for Familial Graph Compression

Ammar Ahmed, Zohair Raza Hassan, Mudassir Shabbir

This document presents a simpler proof showcasing the NP-hardness of Familial Graph Compression.

cs.DB2020

Estimating Descriptors for Large Graphs

Zohair Raza Hassan, Mudassir Shabbir, Imdadullah Khan +1

Embedding networks into a fixed dimensional feature space, while preserving its essential structural properties is a fundamental task in graph analytics. These feature vectors (gra…