Cover Image

A Survey of Densest Subgraph Discovery on Large Graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Luo, Wensheng, Ma, Chenhao, Fang, Yixiang, Lakshmanan, Laks V. S.
Format:	Preprint
Published:	2023
Subjects:	Social and Information Networks
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

In-depth Analysis of Densest Subgraph Discovery in a Unified Framework
by: Zhou, Yingli, et al.
Published: (2024)

Finding Densest Subgraphs with Edge-Color Constraints
by: Oettershagen, Lutz, et al.
Published: (2024)

Topology-Aware LLM-Driven Social Simulation: A Unified Framework for Efficient and Realistic Agent Dynamics
by: Xu, Yuwei, et al.
Published: (2026)

BEACON: A Benchmark for Efficient and Accurate Counting of Subgraphs
by: Najafi, Mohammad Matin, et al.
Published: (2025)

Finding Locally Densest Subgraphs: Convex Programming with Edge and Triangle Density
by: Yang, Yi, et al.
Published: (2025)

The Vertex-Attribute-Constrained Densest $k$-Subgraph Problem
by: Lu, Qiheng, et al.
Published: (2025)

Hyperparametric Robust and Dynamic Influence Maximization
by: Saha, Arkaprava, et al.
Published: (2024)

Scalable Approximate Biclique Counting over Large Bipartite Graphs
by: Chen, Jingbang, et al.
Published: (2025)

Q-DISCO: Query-Centric Densest Subgraphs in Networks with Opinion Information
by: Chen, Tianyi, et al.
Published: (2024)

A Unified Core Structure in Multiplex Networks: From Finding the Densest Subgraph to Modeling User Engagement
by: Hashemi, Farnoosh, et al.
Published: (2024)

Hyperedge Modeling in Hypergraph Neural Networks by using Densest Overlapping Subgraphs
by: Soltani, Mehrad, et al.
Published: (2024)

Scalable Temporal Motif Densest Subnetwork Discovery
by: Sarpe, Ilie, et al.
Published: (2024)

Efficient and Effective Algorithms for A Family of Influence Maximization Problems with A Matroid Constraint
by: Huang, Yiqian, et al.
Published: (2024)

Efficient Historical Butterfly Counting in Large Temporal Bipartite Networks via Graph Structure-aware Index
by: Mang, Qiuyang, et al.
Published: (2024)

On Densest $k$-Subgraph Mining and Diagonal Loading: Optimization Landscape and Finite-Step Exact Convergence Analysis
by: Lu, Qiheng, et al.
Published: (2024)

Fairness-Aware Dense Subgraph Discovery
by: Kariotakis, Emmanouil, et al.
Published: (2024)

Predicting Cascading Failures with a Hyperparametric Diffusion Model
by: Xiang, Bin, et al.
Published: (2024)

Experimental Analysis and Evaluation of Cohesive Subgraph Discovery
by: Kim, Dahee, et al.
Published: (2025)

Scalable Algorithm for Dynamic Quasi-clique Detection
by: Chen, Jingbang, et al.
Published: (2026)

Cohesive Subgraph Discovery in Hypergraphs: A Locality-Driven Indexing Framework
by: Kim, Song, et al.
Published: (2025)

Maintaining Leiden Communities in Large Dynamic Graphs
by: Lin, Chunxu, et al.
Published: (2026)

Scalable Algorithm for Finding Balanced Subgraphs with Tolerance in Signed Networks
by: Chen, Jingbang, et al.
Published: (2024)

Less is More: One-shot Subgraph Reasoning on Large-scale Knowledge Graphs
by: Zhou, Zhanke, et al.
Published: (2024)

TRACE: Intra-visit Clinical Event Nowcasting via Effective Patient Trajectory Encoding
by: Liang, Yuyang, et al.
Published: (2025)

Subgraph Pooling: Tackling Negative Transfer on Graphs
by: Wang, Zehong, et al.
Published: (2024)

Cohesive Group Discovery in Interaction Graphs under Explicit Density Constraints
by: Zhang, Yu, et al.
Published: (2025)

Large Language Model Driven Agents for Simulating Echo Chamber Formation
by: Gu, Chenhao, et al.
Published: (2025)

Densest Subhypergraph: Negative Supermodular Functions and Strongly Localized Methods
by: Huang, Yufan, et al.
Published: (2023)

Covering a Graph with Dense Subgraph Families, via Triangle-Rich Sets
by: Basu, Sabyasachi, et al.
Published: (2024)

GISExplainer: On Explainability of Graph Neural Networks via Game-theoretic Interaction Subgraphs
by: Xian, Xingping, et al.
Published: (2024)

Beyond Trivial Edges: A Fractional Approach to Cohesive Subgraph Detection in Hypergraphs
by: Kim, Hyewon, et al.
Published: (2024)

Tight Practical Bounds for Subgraph Densities in Ego-centric Networks
by: Mattes, Connor, et al.
Published: (2025)

Dense Subgraph Clustering and a New Cluster Ensemble Method
by: Vu-Le, The-Anh, et al.
Published: (2025)

Signed Graph Representation Learning: A Survey
by: Zhang, Zeyu, et al.
Published: (2024)

A Network Formation Model Based on Subgraphs
by: Chandrasekhar, Arun G., et al.
Published: (2016)

A GAN Approach for Node Embedding in Heterogeneous Graphs Using Subgraph Sampling
by: Hsu, Hung-Chun, et al.
Published: (2023)

Towards Graph Prompt Learning: A Survey and Beyond
by: Long, Qingqing, et al.
Published: (2024)

A New Perspective to Node Influence Evaluation in Complex Network Using Subgraph Tr-Centrality
by: Amshi, Auwal Tijjani
Published: (2020)

Representation Learning for Frequent Subgraph Mining
by: Ying, Rex, et al.
Published: (2024)

Bootstrapping Heterogeneous Graph Representation Learning via Large Language Models: A Generalized Approach
by: Gao, Hang, et al.
Published: (2024)