arXiv (All)
open access
Subgraph Isomorphism, Integer Linear Programming, and Lattices: A Linear Algebraic Framework
The subgraph isomorphism problem (SGI) asks a deceptively simple question: is a graph B found inside a parent graph A? Famously NP-complete and the subject of volumes of study, attempts to practically solve subgraph problems typically require specialized software or the focused application of proble
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
- AutoGraphForge: Towards Automated Graph Theory Discovery#926397
- A Survey of Densest Subgraph Discovery on Large Graphs#820128
- Graph theory with applications to engineering and computer science#1332055
- Induced subgraphs and tree decompositions XVIII. Obstructions to bounded pathwidth#1051978
- A Uniform Algorithm for Strict NP on Bounded-Treedepth Graphs#1215659
Record · ID 1455716
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