arXiv (All)
open access
A Separator-based Algorithm for the Graph Edit Distance Problem
The Graph Edit Distance (GED) is a widely used graph similarity measure asking for the minimum cost of a sequence of edits transforming one (labeled) graph into another. The considered edit operations are deletion, insertion, and relabeling of nodes and edges. Special cases include the Graph Isomorp
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Semantics at an Angle: When Cosine Similarity Works Until It Doesn't#793428
- Semantics at an Angle: When Cosine Similarity Works Until It Doesn't#789424
- Best Matches in Phylogenetic Networks#1036091
- Latency-Optimal Geo-Distributed Storage over Structured Networks#972168
- Additional file 1 of Benchmarking MeSH-augmented embeddings for biomedical document similarity#454425
Record · ID 1014788
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive