Image de couverture de livre

Rethinking Flexible Graph Similarity Computation: One-step Alignment with Global Guidance

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Liu, Zhouyang, Liu, Ning, Chen, Yixin, He, Jiezhong, Ma, Shuai, Li, Dongsheng
Format:	Preprint
Publié:	2025
Sujets:	Machine Learning Artificial Intelligence Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Online Algorithms with Unreliable Guidance
par: Dallot, Julien, et autres
Publié: (2026)

Pareto-Optimality, Smoothness, and Stochasticity in Learning-Augmented One-Max-Search
par: Benomar, Ziyad, et autres
Publié: (2025)

Efficient Implementation of the Global Cardinality Constraint with Costs
par: Schmied, Margaux, et autres
Publié: (2025)

Efficient Detection of Exchangeable Factors in Factor Graphs
par: Luttermann, Malte, et autres
Publié: (2024)

Individual Fairness under Varied Notions of Group Fairness in Bipartite Matching - One Framework to Approximate Them All
par: Panda, Atasi, et autres
Publié: (2022)

Variance Computation for Weighted Model Counting with Knowledge Compilation Approach
par: Nakamura, Kengo, et autres
Publié: (2026)

Efficient and Reliable Hitting-Set Computations for the Implicit Hitting Set Approach
par: Ihalainen, Hannes, et autres
Publié: (2025)

Skyline-First Traversal as a Control Mechanism for Multi-Criteria Graph Search
par: Tacheny, Nicolas
Publié: (2026)

Linearithmic Clean-up for Vector-Symbolic Key-Value Memory with Kroneker Rotation Products
par: Liu, Ruipeng, et autres
Publié: (2025)

Multi-armed Bandit and Backbone boost Lin-Kernighan-Helsgaun Algorithm for the Traveling Salesman Problems
par: Wang, Long, et autres
Publié: (2025)

A Mixed-Integer Conic Program for the Moving-Target Traveling Salesman Problem based on a Graph of Convex Sets
par: Philip, Allen George, et autres
Publié: (2024)

Computing and Learning on Combinatorial Data
par: Zhang, Simon
Publié: (2025)

Cluster Vertex Deletion on Chordal Graphs
par: Cao, Yixin, et autres
Publié: (2026)

SimiSketch: Efficiently Estimating Similarity of streaming Multisets
par: Dong, Fenghao, et autres
Publié: (2024)

Approximating Optimal Labelings for Temporal Connectivity
par: Carnevale, Daniele, et autres
Publié: (2025)

FAMST: Fast Approximate Minimum Spanning Tree Construction for Large-Scale and High-Dimensional Data
par: Almansoori, Mahmood K. M., et autres
Publié: (2025)

Fast Stochastic Greedy Algorithm for $k$-Submodular Cover Problem
par: Nguyen, Hue T., et autres
Publié: (2025)

Matrix Editing Meets Fair Clustering: Parameterized Algorithms and Complexity
par: Ganian, Robert, et autres
Publié: (2025)

Masked Matrix Multiplication for Emergent Sparsity
par: Wheatman, Brian, et autres
Publié: (2024)

Queueing, Predictions, and LLMs: Challenges and Open Problems
par: Mitzenmacher, Michael, et autres
Publié: (2025)

Compatibility of Max and Sum Objectives for Committee Selection and $k$-Facility Location
par: Han, Yue, et autres
Publié: (2025)

Adaptive Multi-Round Allocation with Stochastic Arrivals
par: Pan, Yuqi, et autres
Publié: (2026)

Knapsack: Connectedness, Path, and Shortest-Path
par: Dey, Palash, et autres
Publié: (2023)

Online Allocation with Unknown Shared Supply
par: Neoh, Tzeh Yuan, et autres
Publié: (2026)

A Survey on the Densest Subgraph Problem and Its Variants
par: Lanciano, Tommaso, et autres
Publié: (2023)

Parameterized Analysis of Bribery in Challenge the Champ Tournaments
par: Chaudhary, Juhi, et autres
Publié: (2024)

Stochastic Multi-round Submodular Optimization with Budget
par: Auletta, Vincenzo, et autres
Publié: (2024)

Faster and Simpler Greedy Algorithm for $k$-Median and $k$-Means
par: la Tour, Max Dupré, et autres
Publié: (2024)

Lifted Causal Inference in Relational Domains
par: Luttermann, Malte, et autres
Publié: (2024)

The Complexity of Bayesian Network Learning: Revisiting the Superstructure
par: Ganian, Robert, et autres
Publié: (2026)

Nearly Optimal Attention Coresets
par: Liberty, Edo, et autres
Publié: (2026)

Instance Dependent Testing of Samplers using Interval Conditioning
par: Bhattacharyya, Rishiraj, et autres
Publié: (2025)

An Extended Symbolic-Arithmetic Model for Teaching Double-Black Removal with Rotation in Red-Black Trees
par: Ehimwenma, Kennedy E., et autres
Publié: (2025)

Scalable Algorithms for Approximate DNF Model Counting
par: Burkhardt, Paul, et autres
Publié: (2026)

Parallel Greedy Best-First Search with a Bound on Expansions Relative to Sequential Search
par: Shimoda, Takumi, et autres
Publié: (2024)

A Faster Branching Algorithm for the Maximum $k$-Defective Clique Problem
par: Luo, Chunyu, et autres
Publié: (2024)

Universal Hirschberg for Width Bounded Dynamic Programs
par: Nye, Logan
Publié: (2025)

A canonical generalization of OBDD
par: Capelli, Florent, et autres
Publié: (2026)

Identification for Tree-shaped Structural Causal Models in Polynomial Time
par: Gupta, Aaryan, et autres
Publié: (2023)

Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size
par: Fioravantes, Foivos, et autres
Publié: (2025)