arXiv (All)
open access
$Δ$-Motif: Parallel Subgraph Isomorphism via Tabular Operations for Scalable Layout Selection
Subgraph isomorphism is a fundamental problem in graph analysis that seeks to find all instances of a pattern graph within a larger data graph while preserving structural relationships. This NP-complete problem is central to domains such as biological network analysis, social network mining, and qua
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
- $Δ$-Motif: Parallel Subgraph Isomorphism via Tabular Operations for Scalable Layout Selection#920825
- Adopting graph-based pangenomics for agronomy and biodiversity studies: current resources and challenges#1065847
- The parental parsimony problem on binary, tree-child phylogenetic networks#1036730
- Mining tractable sets of graph patterns with the minimum description length principle#1166403
- Automated Inference of Graph Transformation Rules#622689
Record · ID 925059
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