Saved in:
| Main Authors: | Ma, Zhuo, Wen, Dong, Wang, Hanchen, Li, Wentao, Zhang, Wenjie, Lin, Xuemin |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2508.14147 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Accelerating Historical K-Core Search in Temporal Graphs
by: Ma, Zhuo, et al.
Published: (2025)
by: Ma, Zhuo, et al.
Published: (2025)
Efficient Maximal Frequent Group Enumeration in Temporal Bipartite Graphs
by: Wu, Yanping, et al.
Published: (2024)
by: Wu, Yanping, et al.
Published: (2024)
Batch Hop-Constrained s-t Simple Path Query Processing in Large Graphs
by: Yuan, Long, et al.
Published: (2023)
by: Yuan, Long, et al.
Published: (2023)
Common Neighborhood Estimation over Bipartite Graphs under Local Differential Privacy
by: He, Yizhang, et al.
Published: (2025)
by: He, Yizhang, et al.
Published: (2025)
Efficient Unsupervised Community Search with Pre-trained Graph Transformer
by: Wang, Jianwei, et al.
Published: (2024)
by: Wang, Jianwei, et al.
Published: (2024)
Simpler is More: Efficient Top-K Nearest Neighbors Search on Large Road Networks
by: Wang, Yiqi, et al.
Published: (2024)
by: Wang, Yiqi, et al.
Published: (2024)
Efficient Computation of Hyper-triangles on Hypergraphs
by: Yin, Haozhe, et al.
Published: (2025)
by: Yin, Haozhe, et al.
Published: (2025)
Constant-time Connectivity and 2-Edge Connectivity Querying in Dynamic Graphs
by: Xu, Lantian, et al.
Published: (2026)
by: Xu, Lantian, et al.
Published: (2026)
RLMiner: Finding the Most Frequent k-sized Subgraph via Reinforcement Learning
by: Huang, Wei, et al.
Published: (2026)
by: Huang, Wei, et al.
Published: (2026)
DiffGED: Computing Graph Edit Distance via Diffusion-based Graph Matching
by: Huang, Wei, et al.
Published: (2025)
by: Huang, Wei, et al.
Published: (2025)
GTRSS: Graph-based Top-$k$ Representative Similar Subtrajectory Query
by: Ge, Mingchang, et al.
Published: (2025)
by: Ge, Mingchang, et al.
Published: (2025)
Accelerating Regular Path Queries over Graph Database with Processing-in-Memory
by: Ma, Ruoyan, et al.
Published: (2024)
by: Ma, Ruoyan, et al.
Published: (2024)
Revisiting Graph Analytics Benchmark
by: Meng, Lingkai, et al.
Published: (2025)
by: Meng, Lingkai, et al.
Published: (2025)
Efficient Influence Minimization via Node Blocking
by: Wang, Jinghao, et al.
Published: (2024)
by: Wang, Jinghao, et al.
Published: (2024)
Efficient Approximate Nearest Neighbor Search under Multi-Attribute Range Filter
by: Yu, Yuanhang, et al.
Published: (2026)
by: Yu, Yuanhang, et al.
Published: (2026)
HyperJoin: LLM-augmented Hypergraph Link Prediction for Joinable Table Discovery
by: Liu, Shiyuan, et al.
Published: (2026)
by: Liu, Shiyuan, et al.
Published: (2026)
LogLite: Lightweight Plug-and-Play Streaming Log Compression
by: Tang, Benzhao, et al.
Published: (2025)
by: Tang, Benzhao, et al.
Published: (2025)
Efficient Dynamic Attributed Graph Generation
by: Li, Fan, et al.
Published: (2024)
by: Li, Fan, et al.
Published: (2024)
UniCom: Towards a Unified and Cohesiveness-aware Framework for Community Search and Detection
by: Zhu, Yifan, et al.
Published: (2025)
by: Zhu, Yifan, et al.
Published: (2025)
Motif Counting in Complex Networks: A Comprehensive Survey
by: Yin, Haozhe, et al.
Published: (2025)
by: Yin, Haozhe, et al.
Published: (2025)
Influence Minimization via Blocking Strategies
by: Xie, Jiadong, et al.
Published: (2023)
by: Xie, Jiadong, et al.
Published: (2023)
CubeGraph: Efficient Retrieval-Augmented Generation for Spatial and Temporal Data
by: Yang, Mingyu, et al.
Published: (2026)
by: Yang, Mingyu, et al.
Published: (2026)
Towards Temporal Knowledge Graph Alignment in the Wild
by: Zhao, Runhao, et al.
Published: (2025)
by: Zhao, Runhao, et al.
Published: (2025)
Towards Unsupervised Training of Matching-based Graph Edit Distance Solver via Preference-aware GAN
by: Huang, Wei, et al.
Published: (2025)
by: Huang, Wei, et al.
Published: (2025)
Efficient Multiple Temporal Network Kernel Density Estimation
by: Shao, Yu, et al.
Published: (2025)
by: Shao, Yu, et al.
Published: (2025)
Deep Overlapping Community Search via Subspace Embedding
by: Sima, Qing, et al.
Published: (2024)
by: Sima, Qing, et al.
Published: (2024)
AeonG: An Efficient Built-in Temporal Support in Graph Databases
by: Hou, Jiamin, et al.
Published: (2023)
by: Hou, Jiamin, et al.
Published: (2023)
PETGraphDB: A Property Evolution Temporal Graph Data Management System
by: Song, Jinghe, et al.
Published: (2025)
by: Song, Jinghe, et al.
Published: (2025)
StructRide: A Framework to Exploit the Structure Information of Shareability Graph in Ridesharing
by: Zhan, Jiexi, et al.
Published: (2024)
by: Zhan, Jiexi, et al.
Published: (2024)
C$^{2}$TC: A Training-Free Framework for Efficient Tabular Data Condensation
by: Xu, Sijia, et al.
Published: (2026)
by: Xu, Sijia, et al.
Published: (2026)
ESG: Elastic Graphs for Range-Filtering Approximate k-Nearest Neighbor Search
by: Yang, Mingyu, et al.
Published: (2025)
by: Yang, Mingyu, et al.
Published: (2025)
Conflict Detection for Temporal Knowledge Graphs:A Fast Constraint Mining Algorithm and New Benchmarks
by: Chen, Jianhao, et al.
Published: (2023)
by: Chen, Jianhao, et al.
Published: (2023)
Efficient Temporal Simple Path Graph Generation
by: Tang, Zhiyang, et al.
Published: (2025)
by: Tang, Zhiyang, et al.
Published: (2025)
Temporal $k$-Core Query, Revisited
by: Liu, Yinyu, et al.
Published: (2025)
by: Liu, Yinyu, et al.
Published: (2025)
Efficient Antagonistic k-plex Enumeration in Signed Graphs
by: Xu, Lantian, et al.
Published: (2024)
by: Xu, Lantian, et al.
Published: (2024)
Effective and General Distance Computation for Approximate Nearest Neighbor Search
by: Yang, Mingyu, et al.
Published: (2024)
by: Yang, Mingyu, et al.
Published: (2024)
Theoretically and Practically Efficient Resistance Distance Computation on Large Graphs
by: Yang, Yichun, et al.
Published: (2026)
by: Yang, Yichun, et al.
Published: (2026)
Accelerating Graph Indexing for ANNS on Modern CPUs
by: Wang, Mengzhao, et al.
Published: (2025)
by: Wang, Mengzhao, et al.
Published: (2025)
Efficient Discovery of Motif Transition Process for Large-Scale Temporal Graphs
by: Zheng, Zhiyuan, et al.
Published: (2025)
by: Zheng, Zhiyuan, et al.
Published: (2025)
VSAG: An Optimized Search Framework for Graph-based Approximate Nearest Neighbor Search
by: Zhong, Xiaoyao, et al.
Published: (2025)
by: Zhong, Xiaoyao, et al.
Published: (2025)
Similar Items
-
Accelerating Historical K-Core Search in Temporal Graphs
by: Ma, Zhuo, et al.
Published: (2025) -
Efficient Maximal Frequent Group Enumeration in Temporal Bipartite Graphs
by: Wu, Yanping, et al.
Published: (2024) -
Batch Hop-Constrained s-t Simple Path Query Processing in Large Graphs
by: Yuan, Long, et al.
Published: (2023) -
Common Neighborhood Estimation over Bipartite Graphs under Local Differential Privacy
by: He, Yizhang, et al.
Published: (2025) -
Efficient Unsupervised Community Search with Pre-trained Graph Transformer
by: Wang, Jianwei, et al.
Published: (2024)