Scalable Similarity Search over Large Attributed Bipartite Graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Ou, Xi, Lin, Longlong, Wang, Zeli, Yuan, Pingpeng, Li, Rong-Hua
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Fast Biclique Counting on Bipartite Graphs: A Node Pivot-based Approach
by: Ye, Xiaowei, et al.
Published: (2024)

Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges
by: Meng, Lingkai, et al.
Published: (2024)

Fast Answering Pattern-Constrained Reachability Queries with Two-Dimensional Reachability Index
by: Yang, Huihui, et al.
Published: (2025)

Scaling Up Graph Propagation Computation on Large Graphs: A Local Chebyshev Approximation Approach
by: Yang, Yichun, et al.
Published: (2024)

Efficient Top-k s-Biplexes Search over Large Bipartite Graphs
by: Xu, Zhenxiang, et al.
Published: (2024)

BD-Index: Scalable Biharmonic Distance Queries on Large Graphs via Divide-and-Conquer Indexing
by: Pan, Yueyang, et al.
Published: (2025)

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

Scalable and Provable Kemeny Constant Computation on Static and Dynamic Graphs: A 2-Forest Sampling Approach
by: Li, Cheng, et al.
Published: (2025)

Deterministic Search on Complete Bipartite Graphs by Continuous Time Quantum Walk
by: Lin, Honghong, et al.
Published: (2024)

Graph-Based Algorithms for Diverse Similarity Search
by: Anand, Piyush, et al.
Published: (2025)

Biclique Reconfiguration in Bipartite Graphs
by: Otachi, Yota, et al.
Published: (2026)

Interval-Constrained Bipartite Matching over Time
by: Abels, Andreas, et al.
Published: (2024)

Another Hamiltonian Cycle in Bipartite Pfaffian Graphs
by: Björklund, Andreas, et al.
Published: (2023)

Efficient Kernelization Algorithm for Bipartite Graph Matching
by: Wu, Guang, et al.
Published: (2024)

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

Minimum Sum Coloring with Bundles in Trees and Bipartite Graphs
by: Ito, Takehiro, et al.
Published: (2025)

Maintaining Bipartite Colourings on Temporal Graphs on a Budget
by: Adamson, Duncan, et al.
Published: (2025)

Improved Algorithms for Effective Resistance Computation on Graphs
by: Yang, Yichun, et al.
Published: (2025)

Quantum Search on Bipartite Multigraphs
by: Bezerra, Gustavo Alves, et al.
Published: (2025)

Bipartite Matching in Massive Graphs: A Tight Analysis of EDCS
by: Azarmehr, Amir, et al.
Published: (2024)

Nearly-Tight Bounds for Flow Sparsifiers in Quasi-Bipartite Graphs
by: Das, Syamantak, et al.
Published: (2024)

Near-Optimal Dynamic Rounding of Fractional Matchings in Bipartite Graphs
by: Bhattacharya, Sayan, et al.
Published: (2023)

Accelerating Graph Similarity Search through Integer Linear Programming
by: D'Ascenzo, Andrea, et al.
Published: (2025)

A Faster Algorithm for Maximum Weight Matching on Unrestricted Bipartite Graphs
by: Kwok, Shawxing
Published: (2025)

Counting Small Balanced (p,q)-bicliques in Signed Bipartite Graphs
by: Kiran, Mekala, et al.
Published: (2026)

Sum Estimation via Vector Similarity Search
by: Mussmann, Stephen, et al.
Published: (2026)

On Geometric Bipartite Graphs with Asymptotically Smallest Zarankiewicz Numbers
by: Chalermsook, Parinya, et al.
Published: (2025)

Proximity Graphs for Similarity Search: Fast Construction, Lower Bounds, and Euclidean Separation
by: Lu, Shangqi, et al.
Published: (2025)

Perfect Fractional Matchings in Bipartite Graphs Via Proportional Allocations
by: Hathcock, Daniel, et al.
Published: (2025)

From Unweighted to Weighted Dynamic Matching in Non-Bipartite Graphs: A Low-Loss Reduction
by: Bernstein, Aaron, et al.
Published: (2025)

Deterministic Online Bipartite Edge Coloring
by: Blikstad, Joakim, et al.
Published: (2024)

A Freeable Matrix Characterization of Bipartite Graphs of Ferrers Dimension Three
by: Chalermsook, Parinya, et al.
Published: (2025)

Degree-bounded Online Bipartite Matching: OCS vs. Ranking
by: Feng, Yilong, et al.
Published: (2025)

Online Sparsification of Bipartite-Like Clusters in Graphs
by: Das, Joyentanuj, et al.
Published: (2025)

Optimal Rounding for Two-Stage Bipartite Matching
by: Pollner, Tristan, et al.
Published: (2025)

Eternal Vertex Cover on Bipartite and Co-Bipartite Graphs
by: Misra, Neeldhara, et al.
Published: (2022)

$O(\log n)$-Approximation Algorithms for Bipartiteness Ratio
by: Soma, Tasuku, et al.
Published: (2025)

On the Complexity of the Odd-Red Bipartite Perfect Matching Polytope
by: Nägele, Martin, et al.
Published: (2026)

Approximate Bipartite $b$-Matching using Multiplicative Auction
by: Samineni, Bhargav, et al.
Published: (2024)

Online Dependent Rounding Schemes for Bipartite Matchings, with Applications
by: Joseph, et al.
Published: (2023)