Accelerating Graph Similarity Search through Integer Linear Programming

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	D'Ascenzo, Andrea, Meffert, Julian, Mutzel, Petra, Rossi, Fabrizio
Format:	Preprint
Published:	2025
Subjects:	Databases Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

TGLib: An Open-Source Library for Temporal Graph Analysis
by: Oettershagen, Lutz, et al.
Published: (2022)

Revisiting ILP Models for Exact Crossing Minimization in Storyline Drawings
by: Dobler, Alexander, et al.
Published: (2024)

Beer Path Problems in Temporal Graphs
by: D'Ascenzo, Andrea, et al.
Published: (2025)

New Compressed Indices for Multijoins on Graph Databases
by: Arroyuelo, Diego, et al.
Published: (2024)

Efficient Defective Clique Enumeration and Search with Worst-Case Optimal Search Space
by: Jang, Jihoon, et al.
Published: (2025)

A Theoretical Framework for Distribution-Aware Dataset Search
by: Esmailpour, Aryan, et al.
Published: (2025)

Stable Tree Labelling for Accelerating Distance Queries on Dynamic Road Networks
by: Koehler, Henning, et al.
Published: (2025)

GORAM: Graph-oriented ORAM for Efficient Ego-centric Queries on Federated Graphs
by: Fan, Xiaoyu, et al.
Published: (2024)

Weighted Minwise Hashing Beats Linear Sketching for Inner Product Estimation
by: Bessa, Aline, et al.
Published: (2023)

UNIFY: Unified Index for Range Filtered Approximate Nearest Neighbors Search
by: Liang, Anqi, et al.
Published: (2024)

Polynomial Time Convergence of the Iterative Evaluation of Datalogo Programs
by: Im, Sungjin, et al.
Published: (2023)

Approximating Queries on Probabilistic Graphs
by: Amarilli, Antoine, et al.
Published: (2023)

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

CuckooGraph: A Scalable and Space-Time Efficient Data Structure for Large-Scale Dynamic Graphs
by: Fan, Zhuochen, et al.
Published: (2024)

BBC: Improving Large-k Approximate Nearest Neighbor Search with a Bucket-based Result Collector
by: Yin, Ziqi, et al.
Published: (2026)

Hybrid Sketching Methods for Dynamic Connectivity on Sparse Graphs
by: De Man, Quinten, et al.
Published: (2026)

iRangeGraph: Improvising Range-dedicated Graphs for Range-filtering Nearest Neighbor Search
by: Xu, Yuexuan, et al.
Published: (2024)

Balanced Partitioning for Optimizing Big Graph Computation: Complexities and Approximation Algorithms
by: Ning, Baoling, et al.
Published: (2024)

Approaching 100% Confidence in Stream Summary through ReliableSketch
by: Wu, Yuhan, et al.
Published: (2024)

U-HNSW: An Efficient Graph-based Solution to ANNS Under Universal Lp Metrics
by: Wang, Huayi, et al.
Published: (2026)

Practical and Accurate Local Edge Differentially Private Graph Algorithms
by: Mundra, Pranay, et al.
Published: (2025)

PACE Solver Description: Exact Solution of the One-sided Crossing Minimization Problem by the MPPEG Team
by: Jünger, Michael, et al.
Published: (2024)

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search
by: Azizi, Ilias, et al.
Published: (2025)

A Simpler Approach for Monotone Parametric Minimum Cut: Finding the Breakpoints in Order
by: Beines, Arne, et al.
Published: (2024)

GPU-Native Approximate Nearest Neighbor Search with IVF-RaBitQ: Fast Index Build and Search
by: Shi, Jifan, et al.
Published: (2026)

Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search
by: Al-Jazzazi, Yousef, et al.
Published: (2025)

On the Optimal Linear Contraction Order of Tree Tensor Networks, and Beyond
by: Stoian, Mihail, et al.
Published: (2022)

Fine-Grained Dichotomies for Conjunctive Queries with Minimum or Maximum
by: Carmeli, Nofar, et al.
Published: (2025)

Algorithms for Optimizing Acyclic Queries
by: Luo, Zheng, et al.
Published: (2025)

Efficient Hypergraph Pattern Matching via Match-and-Filter and Intersection Constraint
by: Song, Siwoo, et al.
Published: (2025)

Dual-Hierarchy Labelling: Scaling Up Distance Queries on Dynamic Road Networks
by: Farhan, Muhammad, et al.
Published: (2025)

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

Indexing Strings with Utilities
by: Bernardini, Giulia, et al.
Published: (2025)

Efficient Algorithms for Cardinality Estimation and Conjunctive Query Evaluation With Simple Degree Constraints
by: Im, Sungjin, et al.
Published: (2025)

Smaller and More Flexible Cuckoo Filters
by: Schmitz, Johanna Elena, et al.
Published: (2025)

Clustering with Set Outliers and Applications in Relational Clustering
by: Surianarayanan, Vaishali, et al.
Published: (2025)

Towards Lazy B-Trees
by: Rysgaard, Casper Moldrup, et al.
Published: (2025)

Hilbert Forest in the SISAP 2025 Indexing Challenge
by: Imamura, Yasunobu, et al.
Published: (2025)

A High-Throughput GPU Framework for Adaptive Lossless Compression of Floating-Point Data
by: Li, Zheng, et al.
Published: (2025)