arXiv (All)
open access
Efficiently Listing Projected Trees, and Equivalence of Listing and Enumeration
The subgraph isomorphism problem and its generalizations, such as conjunctive queries where some nodes are projected, are among the most fundamental problems in graph algorithms and database theory. In this paper, we study the listing and enumeration variants of these problems and present two main r
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
- A Proof of the Tree Packing Conjecture#821673
- A Survey of Densest Subgraph Discovery on Large Graphs#820128
- An Arboricity-Sensitive Algorithm for the $K_r-e$-Free Graph Sandwich Problem#1049199
- Vertex Cover Interdiction in Bipartite Graphs#1051033
- Near-optimal edge partitioning via intersecting families#1141416
Record · ID 1156377
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