Cover Image

Efficient Maximal Frequent Group Enumeration in Temporal Bipartite Graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Wu, Yanping, Sun, Renjie, Wang, Xiaoyang, Wen, Dong, Zhang, Ying, Qin, Lu, Lin, Xuemin
Format:	Preprint
Published:	2024
Subjects:	Databases
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Efficient Influence Minimization via Node Blocking
by: Wang, Jinghao, et al.
Published: (2024)

Efficient Temporal Simple Path Graph Generation
by: Tang, Zhiyang, et al.
Published: (2025)

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

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

Constant-time Connectivity and 2-Edge Connectivity Querying in Dynamic Graphs
by: Xu, Lantian, et al.
Published: (2026)

Efficient Dynamic Attributed Graph Generation
by: Li, Fan, et al.
Published: (2024)

Accelerating K-Core Computation in Temporal Graphs
by: Ma, Zhuo, et al.
Published: (2025)

Accelerating Historical K-Core Search in Temporal Graphs
by: Ma, Zhuo, et al.
Published: (2025)

Efficient Approximate Nearest Neighbor Search under Multi-Attribute Range Filter
by: Yu, Yuanhang, et al.
Published: (2026)

HL-index: Fast Reachability Query in Hypergraphs
by: Xie, Peiting, et al.
Published: (2025)

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

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

AeonG: An Efficient Built-in Temporal Support in Graph Databases
by: Hou, Jiamin, et al.
Published: (2023)

Maximal Clique Enumeration with Hybrid Branching and Early Termination
by: Wang, Kaixin, et al.
Published: (2024)

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

C$^{2}$TC: A Training-Free Framework for Efficient Tabular Data Condensation
by: Xu, Sijia, et al.
Published: (2026)

Efficient Multiple Temporal Network Kernel Density Estimation
by: Shao, Yu, et al.
Published: (2025)

HyperJoin: LLM-augmented Hypergraph Link Prediction for Joinable Table Discovery
by: Liu, Shiyuan, et al.
Published: (2026)

Efficient Computation of Hyper-triangles on Hypergraphs
by: Yin, Haozhe, et al.
Published: (2025)

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

Deep Overlapping Community Search via Subspace Embedding
by: Sima, Qing, et al.
Published: (2024)

SPER: Accelerating Progressive Entity Resolution via Stochastic Bipartite Maximization
by: Karapiperis, Dimitrios, et al.
Published: (2025)

GTRSS: Graph-based Top-$k$ Representative Similar Subtrajectory Query
by: Ge, Mingchang, et al.
Published: (2025)

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

Batch Hop-Constrained s-t Simple Path Query Processing in Large Graphs
by: Yuan, Long, et al.
Published: (2023)

Efficient Temporal Butterfly Counting and Enumeration on Temporal Bipartite Graphs
by: Cai, Xinwei, et al.
Published: (2023)

A Matrix Logic Approach to Efficient Frequent Itemset Discovery in Large Data Sets
by: Li, Xuan, et al.
Published: (2024)

Efficient Query Rewrite Rule Discovery via Standardized Enumeration and Learning-to-Rank(extend)
by: Zhang, Yuan, et al.
Published: (2026)

Hidden Sketch: A Space-Efficient Reversible Sketch for Tracking Frequent Items in Data Streams
by: Xu, Zicang, et al.
Published: (2025)

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

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

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

Simpler is More: Efficient Top-K Nearest Neighbors Search on Large Road Networks
by: Wang, Yiqi, et al.
Published: (2024)

Towards Efficient Random-Order Enumeration for Join Queries
by: Chen, Pengyu, et al.
Published: (2025)

Efficient Enumeration of Recursive Plans in Transformation-based Query Optimizers
by: Fejza, Amela, et al.
Published: (2023)

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

Maximal Biclique Enumeration with Improved Worst-Case Time Complexity Guarantee: A Partition-Oriented Strategy
by: Wang, Kaixin, et al.
Published: (2026)

Efficiently Listing Projected Trees, and Equivalence of Listing and Enumeration
by: Bringmann, Karl, et al.
Published: (2026)

Graph Structure Learning for Spatial-Temporal Imputation: Adapting to Node and Feature Scales
by: Yang, Xinyu, et al.
Published: (2024)

StructRide: A Framework to Exploit the Structure Information of Shareability Graph in Ridesharing
by: Zhan, Jiexi, et al.
Published: (2024)