{"total":44,"rows":[{"id":"2102.09544","title":"Combinatorial optimization and reasoning with graph neural networks","created":"2021-02-18","cited_by_count":268,"area":null},{"id":"2112.09992","title":"Weisfeiler and Leman go Machine Learning: The Story so far","created":"2021-12-18","cited_by_count":122,"area":null},{"id":"2204.13423","title":"Hybrid Relation Guided Set Matching for Few-shot Action Recognition","created":"2022-04-28","cited_by_count":50,"area":null},{"id":"2112.13143","title":"GREED: A Neural Framework for Learning Graph Distance Functions","created":"2021-12-24","cited_by_count":32,"area":null},{"id":"2406.14929","title":"Efficient Graph Similarity Computation with Alignment Regularization","created":"2024-06-21","cited_by_count":26,"area":null},{"id":"2305.01520","title":"Conditional Graph Information Bottleneck for Molecular Relational Learning","created":"2023-04-29","cited_by_count":24,"area":null},{"id":"2202.02989","title":"Graph Self-supervised Learning with Accurate Discrepancy Learning","created":"2022-02-07","cited_by_count":21,"area":null},{"id":"2305.18451","title":"Shift-Robust Molecular Relational Learning with Causal Substructure","created":"2023-05-29","cited_by_count":15,"area":null},{"id":"2302.03266","title":"Learning to Count Isomorphisms with Graph Neural Networks","created":"2023-02-07","cited_by_count":13,"area":null},{"id":"2301.03330","title":"HyRSM++: Hybrid Relation Guided Temporal Set Matching for Few-shot Action Recognition","created":"2023-01-09","cited_by_count":12,"area":null},{"id":"2305.07633","title":"Zero-shot Item-based Recommendation via Multi-task Product Knowledge Graph Pre-Training","created":"2023-05-12","cited_by_count":12,"area":null},{"id":"2409.17687","title":"Graph Edit Distance with General Costs Using Neural Set Divergence","created":"2024-09-26","cited_by_count":11,"area":null},{"id":"2311.02356","title":"MATA*: Combining Learnable Node Matching with A* Algorithm for Approximate Graph Edit Distance Computation","created":"2023-11-04","cited_by_count":10,"area":null},{"id":"2208.04580","title":"More Interpretable Graph Similarity Computation via Maximum Common Subgraph Inference","created":"2022-08-09","cited_by_count":8,"area":null},{"id":"2210.11020","title":"Maximum Common Subgraph Guided Graph Retrieval: Late and Early Interaction Networks","created":"2022-10-20","cited_by_count":8,"area":null},{"id":"2502.12908","title":"Graph Neural Networks for Databases: A Survey","created":"2025-02-18","cited_by_count":6,"area":null},{"id":"2406.13125","title":"A Unified Framework for Combinatorial Optimization Based on Graph Neural Networks","created":"2024-06-19","cited_by_count":5,"area":null},{"id":"2210.10643","title":"Towards Accurate Subgraph Similarity Computation via Neural Graph Pruning","created":"2022-10-19","cited_by_count":3,"area":null},{"id":"2306.06380","title":"D2Match: Leveraging Deep Learning and Degeneracy for Subgraph Matching","created":"2023-06-10","cited_by_count":3,"area":null},{"id":"2506.01977","title":"Towards Unsupervised Training of Matching-based Graph Edit Distance Solver via Preference-aware GAN","created":"2025-05-16","cited_by_count":3,"area":null},{"id":"2210.11730","title":"Privacy-Preserved Neural Graph Similarity Learning","created":"2022-10-21","cited_by_count":2,"area":null},{"id":"2404.05879","title":"Rapid and Precise Topological Comparison with Merge Tree Neural Networks","created":"2024-04-08","cited_by_count":2,"area":null},{"id":"2505.15867","title":"SCENIR: Visual Semantic Clarity through Unsupervised Scene Graph Retrieval","created":"2025-05-21","cited_by_count":2,"area":null},{"id":"2510.22538","title":"Iteratively Refined Early Interaction Alignment for Subgraph Matching based Graph Retrieval","created":"2025-10-26","cited_by_count":2,"area":null},{"id":"2602.06240","title":"ATEX-CF: Attack-Informed Counterfactual Explanations for Graph Neural Networks","created":"2026-02-05","cited_by_count":2,"area":null},{"id":"2308.13871","title":"Graph Edit Distance Learning via Different Attention","created":"2023-08-26","cited_by_count":1,"area":null},{"id":"2405.16409","title":"Network Interdiction Goes Neural","created":"2024-05-26","cited_by_count":1,"area":null},{"id":"2407.14530","title":"FuncEvalGMN: Evaluating Functional Correctness of SQL via Graph Matching Network","created":"2024-07-09","cited_by_count":1,"area":null},{"id":"2502.18291","title":"Neural Network Graph Similarity Computation Based on Graph Fusion","created":"2025-02-25","cited_by_count":1,"area":null},{"id":"2504.06533","title":"Rethinking Flexible Graph Similarity Computation: One-step Alignment with Global Guidance","created":"2025-04-09","cited_by_count":1,"area":null},{"id":"2510.00394","title":"Graph2Region: Efficient Graph Similarity Learning with Structure and Scale Restoration","created":"2025-10-01","cited_by_count":1,"area":null},{"id":"2602.12740","title":"SPRig: Self-Supervised Pose-Invariant Rigging from Mesh Sequences","created":"2026-02-13","cited_by_count":1,"area":null},{"id":"2111.05936","title":"SPA-GCN: Efficient and Flexible GCN Accelerator with an Application for Graph Similarity Computation","created":"2021-11-10","cited_by_count":0,"area":null},{"id":"2307.15377","title":"Co-attention Graph Pooling for Efficient Pairwise Graph Interaction Learning","created":"2023-07-28","cited_by_count":0,"area":null},{"id":"2402.05885","title":"EUGENE: Explainable Structure-aware Graph Edit Distance Estimation with Generalized Edit Costs","created":"2024-02-08","cited_by_count":0,"area":null},{"id":"2404.09812","title":"Solving the Tree Containment Problem Using Graph Neural Networks","created":"2024-04-15","cited_by_count":0,"area":null},{"id":"2411.03624","title":"SEGMN: A Structure-Enhanced Graph Matching Network for Graph Similarity Learning","created":"2024-11-06","cited_by_count":0,"area":null},{"id":"2412.12185","title":"Graph Similarity Computation via Interpretable Neural Node Alignment","created":"2024-12-13","cited_by_count":0,"area":null},{"id":"2503.08739","title":"HeGMN: Heterogeneous Graph Matching Network for Learning Graph Similarity","created":"2025-03-11","cited_by_count":0,"area":null},{"id":"2510.22897","title":"Charting the Design Space of Neural Graph Representations for Subgraph Matching","created":"2025-10-27","cited_by_count":0,"area":null},{"id":"2511.19837","title":"GED-Consistent Disentanglement of Aligned and Unaligned Substructures for Graph Similarity Learning","created":"2025-11-25","cited_by_count":0,"area":null},{"id":"2604.05929","title":"ReLU Networks for Exact Generation of Similar Graphs","created":"2026-04-07","cited_by_count":0,"area":null},{"id":"2605.06588","title":"Towards Metric-Faithful Neural Graph Matching","created":"2026-05-07","cited_by_count":0,"area":null},{"id":"2610.04644","title":"Revisiting the Generalization of Neural Graph Edit Distance Models","created":"2026-10-03","cited_by_count":0,"area":null}],"next_cursor":null}