Research map / Graph learning / Graph algorithms and clustering
Between Subgraph Isomorphism and Maximum Common Subgraph
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.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| add path-based supplemental graph constraints (k = 0) (ablation) | k-less subgraph isomorphism, induced · 5,725 instances | permitted assignment pair ratio | Helped |
| add path-based constraints as k grows to 3 (ablation) | k-less subgraph isomorphism, induced · 5,725 instances | permitted assignment pair ratio | Hurt |
| iteratively increase k from 0 instead of MCS algorithms (FC, clique) | maximum common induced subgraph · 5,725 instances | instances closed | Helped |
| iteratively increase k vs clique approach on standard MCS benchmark | maximum common induced subgraph · MCS benchmark, 4,110 instances | instances solved over time | Helped |
Closest papers by meaning
- SAT-Based Algorithms for Regular Graph Pattern Matching (AAAI 2024 · similarity 0.86)
- Optimal Quasi-clique: Hardness, Equivalence with Densest-k-Subgraph, and Quasi-partitioned Community Mining (AAAI 2024 · similarity 0.86)
- Densest k-Subgraph Mining via a Provably Tight Relaxation (AAAI 2025 · similarity 0.86)
- On the Power of the Weisfeiler-Leman Test for Graph Motif Parameters (ICLR 2024 · similarity 0.85)
- End-to-End Verification for Subgraph Solving (AAAI 2024 · similarity 0.85)
- Homomorphism Counts for Graph Neural Networks: All About That Basis (ICML 2024 · similarity 0.85)
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.