{"total":88,"rows":[{"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":"2107.01188","title":"Combinatorial Optimization with Physics-Inspired Graph Neural Networks","created":"2021-07-02","cited_by_count":108,"area":null},{"id":"2110.13100","title":"Parameter Prediction for Unseen Deep Architectures","created":"2021-10-25","cited_by_count":89,"area":null},{"id":"2211.04208","title":"GOOD-D: On Unsupervised Graph Out-Of-Distribution Detection","created":"2022-11-08","cited_by_count":47,"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":"2106.04927","title":"A Bi-Level Framework for Learning to Solve Combinatorial Optimization on Graphs","created":"2021-06-09","cited_by_count":26,"area":null},{"id":"2406.14929","title":"Efficient Graph Similarity Computation with Alignment Regularization","created":"2024-06-21","cited_by_count":26,"area":null},{"id":"2203.14987","title":"Multilingual Knowledge Graph Completion with Self-Supervised Adaptive Graph Alignment","created":"2022-03-28","cited_by_count":24,"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":"2205.02435","title":"FAITH: Few-Shot Graph Classification with Hierarchical Task Graphs","created":"2022-05-05","cited_by_count":22,"area":null},{"id":"2104.05960","title":"Hierarchical Adaptive Pooling by Capturing High-order Dependency for Graph Representation Learning","created":"2021-04-13","cited_by_count":15,"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":"2309.10979","title":"Towards Data-centric Graph Machine Learning: Review and Outlook","created":"2023-09-20","cited_by_count":15,"area":null},{"id":"2210.01974","title":"Towards Prototype-Based Self-Explainable Graph Neural Network","created":"2022-10-05","cited_by_count":14,"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":"2107.06876","title":"Scalable Optimal Transport in High Dimensions for Graph Distances, Embedding Alignment, and More","created":"2021-07-14","cited_by_count":11,"area":null},{"id":"2208.07012","title":"MM-GNN: Mix-Moment Graph Neural Network towards Modeling Neighborhood Feature Distribution","created":"2022-08-15","cited_by_count":11,"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":"2403.19474","title":"SG-PGM: Partial Graph Matching Network with Semantic Geometric Fusion for 3D Scene Graph Alignment and Its Downstream Tasks","created":"2024-03-28","cited_by_count":10,"area":null},{"id":"2105.04067","title":"Neural Graph Matching based Collaborative Filtering","created":"2021-05-10","cited_by_count":9,"area":null},{"id":"2107.07089","title":"STAR: Sparse Transformer-based Action Recognition","created":"2021-07-15","cited_by_count":8,"area":null},{"id":"2205.15083","title":"CGMN: A Contrastive Graph Matching Network for Self-Supervised Graph Similarity Learning","created":"2022-05-30","cited_by_count":8,"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":"2505.22109","title":"The quest for the GRAph Level autoEncoder (GRALE)","created":"2025-05-28","cited_by_count":8,"area":null},{"id":"2103.00137","title":"Meta-Learning with Graph Neural Networks: Methods and Applications","created":"2021-02-27","cited_by_count":7,"area":null},{"id":"2210.16815","title":"CAD 3D Model classification by Graph Neural Networks: A new approach based on STEP format","created":"2022-10-30","cited_by_count":6,"area":null},{"id":"2412.18857","title":"Computing Approximate Graph Edit Distance via Optimal Transport","created":"2024-12-25","cited_by_count":6,"area":null},{"id":"2502.12908","title":"Graph Neural Networks for Databases: A Survey","created":"2025-02-18","cited_by_count":6,"area":null},{"id":"2104.00186","title":"Sub-GMN: The Neural Subgraph Matching Network Model","created":"2021-04-01","cited_by_count":5,"area":null},{"id":"2307.00783","title":"Monte Carlo Policy Gradient Method for Binary Optimization","created":"2023-07-03","cited_by_count":5,"area":null},{"id":"2307.13499","title":"Finding Money Launderers Using Heterogeneous Graph Neural Networks","created":"2023-07-25","cited_by_count":5,"area":null},{"id":"2402.14367","title":"Representation Learning for Frequent Subgraph Mining","created":"2024-02-22","cited_by_count":5,"area":null},{"id":"2207.04216","title":"Wasserstein Graph Distance Based on $L_1$-Approximated Tree Edit Distance between Weisfeiler-Lehman Subtrees","created":"2022-07-09","cited_by_count":4,"area":null},{"id":"2110.01872","title":"Permute Me Softly: Learning Soft Permutations for Graph Representations","created":"2021-10-05","cited_by_count":3,"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":"2403.06317","title":"An End-to-End Deep Learning Generative Framework for Refinable Shape Matching and Generation","created":"2024-03-10","cited_by_count":3,"area":null},{"id":"2505.12325","title":"Neural Graduated Assignment for Maximum Common Edge Subgraphs","created":"2025-05-18","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":"2511.02489","title":"Object-aware graph matching network for cross-domain remote sensing image localization","created":"2025-11-04","cited_by_count":3,"area":null},{"id":"2107.08594","title":"Optimal Resource Allocation for Serverless Queries","created":"2021-07-19","cited_by_count":2,"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":"2412.01849","title":"Towards Data-centric Machine Learning on Directed Graphs: a Survey","created":"2024-11-28","cited_by_count":2,"area":null},{"id":"2501.19382","title":"LiDAR Loop Closure Detection using Semantic Graphs with Graph Attention Networks","created":"2025-01-31","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":"2509.03737","title":"LayoutGKN: Graph Similarity Learning of Floor Plans","created":"2025-09-03","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":"2101.12430","title":"Subgraph nomination: Query by Example Subgraph Retrieval in Networks","created":"2021-01-29","cited_by_count":1,"area":null},{"id":"2106.13061","title":"Fea2Fea: Exploring Structural Feature Correlations via Graph Neural Networks","created":"2021-06-24","cited_by_count":1,"area":null},{"id":"2205.14275","title":"Image Keypoint Matching using Graph Neural Networks","created":"2022-05-27","cited_by_count":1,"area":null},{"id":"2308.13871","title":"Graph Edit Distance Learning via Different Attention","created":"2023-08-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":"2505.11396","title":"Finding Counterfactual Evidences for Node Classification","created":"2025-05-16","cited_by_count":1,"area":null},{"id":"2505.21988","title":"Functional Matching of Logic Subgraphs: Beyond Structural Isomorphism","created":"2025-05-28","cited_by_count":1,"area":null},{"id":"2508.03111","title":"GEDAN: Learning the Edit Costs for Graph Edit Distance","created":"2025-08-05","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":"2510.00402","title":"Hierarchy-Aware Neural Subgraph Matching with Enhanced Similarity Measure","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":"2603.11039","title":"Instruction set for the representation of graphs","created":"2026-03-11","cited_by_count":1,"area":null},{"id":"2606.06364","title":"End-to-End Subgraph Detection with GraphDETR","created":"2026-06-04","cited_by_count":1,"area":null},{"id":"2102.07007","title":"A Statistical Relational Approach to Learning Distance-based GCNs","created":"2021-02-13","cited_by_count":0,"area":null},{"id":"2110.04280","title":"Pyxis: An Open-Source Performance Dataset of Sparse Accelerators","created":"2021-10-08","cited_by_count":0,"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":"2305.08318","title":"CMSG Cross-Media Semantic-Graph Feature Matching Algorithm for Autonomous Vehicle Relocalization","created":"2023-05-15","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":"2310.18444","title":"M3C: A Framework towards Convergent, Flexible, and Unsupervised Learning of Mixture Graph Matching and Clustering","created":"2023-10-27","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":"2403.13215","title":"Leveraging advances in machine learning for the robust classification and interpretation of networks","created":"2024-03-20","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":"2412.12185","title":"Graph Similarity Computation via Interpretable Neural Node Alignment","created":"2024-12-13","cited_by_count":0,"area":null},{"id":"2503.00426","title":"Auto-encoding Molecules: Graph-Matching Capabilities Matter","created":"2025-03-01","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":"2507.19518","title":"Target Circuit Matching in Large-Scale Netlists using GNN-Based Region Prediction","created":"2025-07-18","cited_by_count":0,"area":null},{"id":"2508.06177","title":"Graph-based Robot Localization Using a Graph Neural Network with a Floor Camera and a Feature Rich Industrial Floor","created":"2025-08-08","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":"2512.18407","title":"Through the PRISm: Importance-Aware Scene Graphs for Image Retrieval","created":"2025-12-20","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":"2605.27931","title":"DiagramRAG: A Lightweight Framework to Retrieve Scientific Diagram for Figure Generation","created":"2026-05-27","cited_by_count":0,"area":null},{"id":"2606.01987","title":"Graph Edit Distance Formulation for the Vehicle Routing Problem: Theory and Analysis","created":"2026-06-01","cited_by_count":0,"area":null},{"id":"2607.03049","title":"Alignment-Guided Largest Table Overlap Size Estimation","created":"2026-07-03","cited_by_count":0,"area":null},{"id":"2607.18311","title":"Approximating SPR Distance Between Phylogenetic Trees with Graph Neural Networks","created":"2026-07-17","cited_by_count":0,"area":null},{"id":"2609.32661","title":"Equivariant Neural Primal-Dual Assignment for Maximum Common Edge Subgraphs","created":"2026-09-26","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}