{"total":16,"rows":[{"id":"2302.03266","title":"Learning to Count Isomorphisms with Graph Neural Networks","created":"2023-02-07","cited_by_count":13,"area":null},{"id":"2112.08764","title":"Graph Convolutional Networks with Dual Message Passing for Subgraph Isomorphism Counting and Matching","created":"2021-12-16","cited_by_count":11,"area":null},{"id":"2205.10106","title":"LeNSE: Learning To Navigate Subgraph Embeddings for Large-Scale Combinatorial Optimisation","created":"2022-05-20","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":"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":"2407.08762","title":"Commute-Time-Optimised Graphs for GNNs","created":"2024-07-09","cited_by_count":4,"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":"2112.03404","title":"Learning to Detect Critical Nodes in Sparse Graphs via Feature Importance Awareness","created":"2021-12-03","cited_by_count":2,"area":null},{"id":"2210.10374","title":"Learning Universe Model for Partial Matching Networks over Multiple Graphs","created":"2022-10-19","cited_by_count":2,"area":null},{"id":"2406.12712","title":"Self-Localized Collaborative Perception","created":"2024-06-18","cited_by_count":2,"area":null},{"id":"2207.10305","title":"Detecting Small Query Graphs in A Large Graph via Neural Subgraph Search","created":"2022-07-21","cited_by_count":1,"area":null},{"id":"2204.01057","title":"A Survey on Machine Learning Solutions for Graph Pattern Extraction","created":"2022-04-03","cited_by_count":0,"area":null},{"id":"2208.08620","title":"Hybrid Learning with New Value Function for the Maximum Common Subgraph Problem","created":"2022-08-18","cited_by_count":0,"area":null},{"id":"2304.09975","title":"Solving the Kidney-Exchange Problem via Graph Neural Networks with No Supervision","created":"2023-04-19","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":"2609.32661","title":"Equivariant Neural Primal-Dual Assignment for Maximum Common Edge Subgraphs","created":"2026-09-26","cited_by_count":0,"area":null}],"next_cursor":null}