arXiv (All)
open access
Generalized Graph Search Trees
Graph search algorithms and their corresponding graph search trees are commonly used in algorithmic graph theory. In recent years, the recognition problem of these graph search trees has received significant attention. So far, the research has focused on two types of search trees: first-in trees tha
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
- Classification of imbalanced data with a geometric digraph family#934703
- A Forced-Structure Reduction and Verifiable Bounds for Conway's 99-Graph#1036437
- Parameterized Complexity of Edge-Constrained Graph Partitioning#793011
- Parameterized Complexity of Edge-Constrained Graph Partitioning#789007
- Gopher: Efficient Dynamic Graph Pattern Mining via DAG-Driven Execution#279739
Record · ID 985960
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