Research map / Graph learning / Graph algorithms and clustering
Neural Graduated Assignment for Maximum Common Edge Subgraphs
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Charting the Design Space of Neural Graph Representations for Subgraph Matching (ICLR 2025 · similarity 0.88)
- Maximum Common Subgraph Guided Graph Retrieval: Late and Early Interaction Networks (NeurIPS 2022 · similarity 0.88)
- Learning Combinatorial Solver for Graph Matching (CVPR 2020 · similarity 0.88)
- FRAM: Frobenius-Regularized Assignment Matching with Mixed-Precision Computing (NeurIPS 2025 · similarity 0.87)
- Are Graph Neural Networks Optimal Approximation Algorithms? (NeurIPS 2024 · similarity 0.86)
- COMBHelper: A Neural Approach to Reduce Search Space for Graph Combinatorial Problems (AAAI 2024 · similarity 0.86)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.