Optimal $(α,β)$-Dense Subgraph Search in Bipartite Graphs

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Zhang, Yalong, Li, Rong-Hua, Zhang, Qi, Wang, Guoren
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Databases
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

A Computationally Efficient Framework for Overlapping Community Detection in Large Bipartite Graphs
di: Zeng, Yue, et al.
Pubblicazione: (2025)

RNSG: A Range-Aware Graph Index for Efficient Range-Filtered Approximate Nearest Neighbor Search
di: Zou, Zhiqiu, et al.
Pubblicazione: (2026)

MCI: A Maximal Clique Index for Efficient Arbitrary-Filtered Approximate Nearest Neighbor Search
di: Ye, Xiaowei, et al.
Pubblicazione: (2026)

Efficient Antagonistic k-plex Enumeration in Signed Graphs
di: Xu, Lantian, et al.
Pubblicazione: (2024)

Theoretically and Practically Efficient Resistance Distance Computation on Large Graphs
di: Yang, Yichun, et al.
Pubblicazione: (2026)

Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach
di: Liao, Meihao, et al.
Pubblicazione: (2025)

FedGTA: Topology-aware Averaging for Federated Graph Learning
di: Li, Xunkai, et al.
Pubblicazione: (2024)

Scalable $k$-clique Densest Subgraph Search
di: Ye, Xiaowei, et al.
Pubblicazione: (2024)

StreamTGN: A GPU-Efficient Serving System for Streaming Temporal Graph Neural Networks
di: Zhang, Lingling, et al.
Pubblicazione: (2026)

Common Neighborhood Estimation over Bipartite Graphs under Local Differential Privacy
di: He, Yizhang, et al.
Pubblicazione: (2025)

Federated Prototype Graph Learning
di: Wu, Zhengyu, et al.
Pubblicazione: (2025)

RoarGraph: A Projected Bipartite Graph for Efficient Cross-Modal Approximate Nearest Neighbor Search
di: Chen, Meng, et al.
Pubblicazione: (2024)

Efficient Maximal Frequent Group Enumeration in Temporal Bipartite Graphs
di: Wu, Yanping, et al.
Pubblicazione: (2024)

Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach
di: Li, Xunkai, et al.
Pubblicazione: (2025)

Towards Data-centric Machine Learning on Directed Graphs: a Survey
di: Sun, Henan, et al.
Pubblicazione: (2024)

S$^3$GND: An Effective Learning-Based Approach for Subgraph Similarity Search Under Generalized Neighbor Difference Semantics (Technical Report)
di: Wen, Qi, et al.
Pubblicazione: (2026)

Effective Bug Detection in Graph Database Engines: An LLM-based Approach
di: Wu, Jiayi, et al.
Pubblicazione: (2024)

An Efficient Proximity Graph-based Approach to Table Union Search
di: Xie, Yiming, et al.
Pubblicazione: (2025)

Graph Learning in the Era of LLMs: A Survey from the Perspective of Data, Models, and Tasks
di: Li, Xunkai, et al.
Pubblicazione: (2024)

Toward Data-centric Directed Graph Learning: An Entropy-driven Approach
di: Li, Xunkai, et al.
Pubblicazione: (2025)

AdaFGL: A New Paradigm for Federated Node Classification with Topology Heterogeneity
di: Li, Xunkai, et al.
Pubblicazione: (2024)

OpenFGL: A Comprehensive Benchmark for Federated Graph Learning
di: Li, Xunkai, 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)

S3AND: Efficient Subgraph Similarity Search Under Aggregated Neighbor Difference Semantics (Technical Report)
di: Wen, Qi, et al.
Pubblicazione: (2025)

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

Multivariate Time Series Cleaning under Speed Constraints
di: Zhang, Aoqian, et al.
Pubblicazione: (2024)

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

Graph-Based Feature Augmentation for Predictive Tasks on Relational Datasets
di: Qiao, Lianpeng, et al.
Pubblicazione: (2025)

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

Towards Unbiased Federated Graph Learning: Label and Topology Perspectives
di: Wu, Zhengyu, et al.
Pubblicazione: (2025)

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

Verifiable, Efficient and Confidentiality-Preserving Graph Search with Transparency
di: Wang, Qiuhao, et al.
Pubblicazione: (2025)

Efficient Community Detection Over Streaming Bipartite Networks (Technical Report)
di: Zhang, Nan, et al.
Pubblicazione: (2024)

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

FedTAD: Topology-aware Data-free Knowledge Distillation for Subgraph Federated Learning
di: Zhu, Yinlin, et al.
Pubblicazione: (2024)

Efficient Community Search on Attributed Public-Private Graphs
di: Chen, Yuqi, et al.
Pubblicazione: (2026)

Frequency-Aware Graph Construction and Search for Dynamic Vector Databases
di: Zhu, Yifan, et al.
Pubblicazione: (2025)

Optimizing SSD-Resident Graph Indexing for High-Throughput Vector Search
di: Zhao, Weichen, et al.
Pubblicazione: (2026)

Toward Effective Digraph Representation Learning: A Magnetic Adaptive Propagation based Approach
di: Li, Xunkai, et al.
Pubblicazione: (2025)

Efficient Unsupervised Community Search with Pre-trained Graph Transformer
di: Wang, Jianwei, et al.
Pubblicazione: (2024)