
-
Parallel Algorithms for Densest Subgraph Discovery Using Shared Memory Model
The problem of finding dense components of a graph is a widely explored ...
read it
-
Mapping Network States Using Connectivity Queries
Can we infer all the failed components of an infrastructure network, giv...
read it
-
PAC-Learning for Strategic Classification
Machine learning (ML) algorithms may be susceptible to being gamed by in...
read it
-
SubGraph2Vec: Highly-Vectorized Tree-likeSubgraph Counting
Subgraph counting aims to count occurrences of a template T in a given n...
read it
-
Models for COVID-19 Pandemic: A Comparative Analysis
COVID-19 pandemic represents an unprecedented global health crisis in th...
read it
-
Approximation Algorithms for Radius-Based, Two-Stage Stochastic Clustering Problems with Budget Constraints
The main focus of this paper is radius-based clustering problems in the ...
read it
-
Efficient Algorithms for Generating Provably Near-Optimal Cluster Descriptors for Explainability
Improving the explainability of the results from machine learning method...
read it
-
A GraphBLAS Approach for Subgraph Counting
Subgraph counting aims to count the occurrences of a subgraph template T...
read it
-
High-Performance Massive Subgraph Counting using Pipelined Adaptive-Group Communication
Subgraph counting aims to count the number of occurrences of a subgraph ...
read it