Copertina

Finding Locally Densest Subgraphs: Convex Programming with Edge and Triangle Density

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Yang, Yi, Ma, Chenhao, Cheng, Reynold, Lakshmanan, Laks V. S., Han, Xiaolin
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Databases
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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

Fast Maximum Common Subgraph Search: A Redundancy-Reduced Backtracking Approach
di: Yu, Kaiqiang, et al.
Pubblicazione: (2025)

A Survey of Densest Subgraph Discovery on Large Graphs
di: Luo, Wensheng, et al.
Pubblicazione: (2023)

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

On Efficient Approximate Aggregate Nearest Neighbor Queries over Learned Representations
di: Wang, Carrie, et al.
Pubblicazione: (2025)

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

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

Dupin: A Parallel Framework for Densest Subgraph Discovery in Fraud Detection on Massive Graphs (Technical Report)
di: Jiang, Jiaxin, et al.
Pubblicazione: (2025)

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

ThriftLLM: On Cost-Effective Selection of Large Language Models for Classification Queries
di: Huang, Keke, et al.
Pubblicazione: (2025)

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

RLMiner: Finding the Most Frequent k-sized Subgraph via Reinforcement Learning
di: Huang, Wei, et al.
Pubblicazione: (2026)

Revisiting Task-Oriented Dataset Search in the Era of Large Language Models: Challenges, Benchmark, and Solution
di: Wei, Zixin, et al.
Pubblicazione: (2025)

Efficient Densest Flow Queries in Transaction Flow Networks (Complete Version)
di: Jiang, Jiaxin, et al.
Pubblicazione: (2026)

Multi-granularity Spatiotemporal Flow Patterns
di: Kosyfaki, Chrysanthi, et al.
Pubblicazione: (2025)

DIST: Efficient k-Clique Listing via Induced Subgraph Trie
di: Nam, Yehyun, et al.
Pubblicazione: (2025)

Efficient and Effective Table-Centric Table Union Search in Data Lakes
di: Sun, Yongkang, et al.
Pubblicazione: (2026)

EMA: Approximate Nearest Neighbor Search with General Attribute Filtering and Dynamic Updates
di: Li, Mocheng, et al.
Pubblicazione: (2026)

NeuSO: Neural Optimizer for Subgraph Queries
di: Yang, Linglin, et al.
Pubblicazione: (2025)

Communication-Efficient Triangle Counting under Local Differential Privacy
di: Imola, Jacob, et al.
Pubblicazione: (2021)

Cardinality Estimation of Subgraph Matching: A Filtering-Sampling Approach
di: Shin, Wonseok, et al.
Pubblicazione: (2023)

A Sampling-based Framework for Hypothesis Testing on Large Attributed Graphs
di: Wang, Yun, et al.
Pubblicazione: (2024)

gMatch: Fine-Grained and Hardware-Efficient Subgraph Matching on GPUs
di: Chen, Weitian, et al.
Pubblicazione: (2026)

CEMR: An Effective Subgraph Matching Algorithm with Redundant Extension Elimination
di: Yang, Linglin, et al.
Pubblicazione: (2026)

Finding Non-Redundant Simpson's Paradox from Multidimensional Data
di: Yang, Yi, et al.
Pubblicazione: (2025)

Efficient Partition-based Approaches for Diversified Top-k Subgraph Matching
di: Chen, Liuyi, et al.
Pubblicazione: (2025)

Towards Robust Trajectory Embedding for Similarity Computation: When Triangle Inequality Violations in Distance Metrics Matter
di: Si, Jianing, et al.
Pubblicazione: (2025)

LIVE: Learnable Monotonic Vertex Embedding for Efficient Exact Subgraph Matching (Technical Report)
di: Ye, Yutong, et al.
Pubblicazione: (2026)

Optimal $(α,β)$-Dense Subgraph Search in Bipartite Graphs
di: Zhang, Yalong, et al.
Pubblicazione: (2025)

XMiner: Efficient Directed Subgraph Matching with Pattern Reduction
di: Yuan, Pingpeng, et al.
Pubblicazione: (2024)

Color: A Framework for Applying Graph Coloring to Subgraph Cardinality Estimation
di: Deeds, Kyle, et al.
Pubblicazione: (2024)

GNN-based Anchor Embedding for Efficient Exact Subgraph Matching
di: Yang, Bin, et al.
Pubblicazione: (2025)

GraphMatch: Subgraph Query Processing on FPGAs
di: Dann, Jonas, et al.
Pubblicazione: (2024)

BEST-Route: Adaptive LLM Routing with Test-Time Optimal Compute
di: Ding, Dujian, et al.
Pubblicazione: (2025)

Destroying Densest Subgraphs is Hard
di: Bazgan, Cristina, et al.
Pubblicazione: (2024)

Attribute Filtering in Approximate Nearest Neighbor Search: An In-depth Experimental Study
di: Li, Mocheng, et al.
Pubblicazione: (2025)

TRIM: Accelerating High-Dimensional Vector Similarity Search with Enhanced Triangle-Inequality-Based Pruning
di: Song, Yitong, et al.
Pubblicazione: (2025)

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

FLEXIS: FLEXible Frequent Subgraph Mining using Maximal Independent Sets
di: Sharma, Akshit, et al.
Pubblicazione: (2024)

Efficient Exact Subgraph Matching via GNN-based Path Dominance Embedding (Technical Report)
di: Ye, Yutong, et al.
Pubblicazione: (2023)