Accelerating directed densest subgraph queries with software and hardware approaches
Given a directed graph G, the directed densest subgraph (DDS) problem refers to finding a
subgraph from G, whose density is the highest among all subgraphs of G. The DDS problem …
subgraph from G, whose density is the highest among all subgraphs of G. The DDS problem …
Practical Parallel Algorithms for Near-Optimal Densest Subgraphs on Massive Graphs
The densest subgraph problem has received significant attention, both in theory and in
practice, due to its applications in problems such as community detection, social network …
practice, due to its applications in problems such as community detection, social network …
A Similarity-based Approach for Efficient Large Quasi-clique Detection
Identifying dense subgraphs called quasi-cliques is pivotal in various graph mining tasks
across domains like biology, social networks, and e-commerce. However, recent algorithms …
across domains like biology, social networks, and e-commerce. However, recent algorithms …
Efficient Algorithms for Density Decomposition on Large Static and Dynamic Graphs
Locally-densest subgraph (LDS) decomposition is a fundamental decomposition in graph
analysis that finds numerous applications in various domains, including community …
analysis that finds numerous applications in various domains, including community …
Mining Triangle-Dense Subgraphs of a Fixed Size: Hardness, Lovasz extension and´ Applications
A Konar, ND Sidiropoulos - IEEE Transactions on Knowledge …, 2024 - ieeexplore.ieee.org
We introduce the triangle-densest-k-subgraph problem (TDkS) for undirected graphs: given
a size parameter k, compute a subset of k vertices that maximizes the number of induced …
a size parameter k, compute a subset of k vertices that maximizes the number of induced …
Scalable Algorithm for Finding Balanced Subgraphs with Tolerance in Signed Networks
Signed networks, characterized by edges labeled as either positive or negative, offer
nuanced insights into interaction dynamics beyond the capabilities of unsigned graphs …
nuanced insights into interaction dynamics beyond the capabilities of unsigned graphs …
A Counting-based Approach for Efficient k-Clique Densest Subgraph Discovery
Densest subgraph discovery (DSD) is a fundamental topic in graph mining. It has been
extensively studied in the literature and has found many real applications in a wide range of …
extensively studied in the literature and has found many real applications in a wide range of …
Efficient State Sharding in Blockchain via Density-based Graph Partitioning
B Yin, P Zhang, T Chen - ACM Transactions on the Web, 2024 - dl.acm.org
Sharding is a promising technique for increasing a blockchain system's throughput by
enabling parallel transaction processing. The main challenge of state sharding lies in …
enabling parallel transaction processing. The main challenge of state sharding lies in …
Share: Stackelberg-Nash based Data Markets
With the prevalence of data-driven intelligence, data markets with various data products are
gaining considerable interest as a promising paradigm for commoditizing data and …
gaining considerable interest as a promising paradigm for commoditizing data and …
In-depth Analysis of Densest Subgraph Discovery in a Unified Framework
As a fundamental topic in graph mining, Densest Subgraph Discovery (DSD) has found a
wide spectrum of real applications. Several DSD algorithms, including exact and …
wide spectrum of real applications. Several DSD algorithms, including exact and …