11 citations · 36 across the 27 of their papers we have counts for
6 papers · 1 filter
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.
Interplay Between Resilience and Accuracy in Resilient Vector Consensus in Multi-Agent Networks
Waseem Abbas, Mudassir Shabbir, Jiani Li +1
In this paper, we study the relationship between resilience and accuracy in the resilient distributed multi-dimensional consensus problem. We consider a network of agents, each of…
Strong Structural Controllability of Diffusively Coupled Networks: Comparison of Bounds Based on Distances and Zero Forcing
Yasin Yazicioglu, Mudassir Shabbir, Waseem Abbas +1
We study the strong structural controllability (SSC) of diffusively coupled networks, where the external control inputs are injected to only some nodes, namely the leaders. For suc…
Improving Network Robustness through Edge Augmentation While Preserving Strong Structural Controllability
Waseem Abbas, Mudassir Shabbir, Hassan Jaleel +1
In this paper, we consider a network of agents with Laplacian dynamics, and study the problem of improving network robustness by adding a maximum number of edges within the network…
Resilient Distributed Vector Consensus Using Centerpoints
Waseem Abbas, Mudassir Shabbir, Jiani Li +1
In this paper, we study the resilient vector consensus problem in networks with adversarial agents and improve resilience guarantees of existing algorithms. A common approach to ac…
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…