arXiv (OAI Expanded)
open access
Layer-Based Width for PAFP
The Path Avoiding Forbidden Pairs problem (PAFP) asks whether, in a directed graph $G$ with terminals $s,t$ and a set $\mathcal{F}$ of forbidden vertex pairs, there is an $s$-$t$ path that contains at most one endpoint from each forbidden pair. We initiate the study of PAFP through a layer-based wid
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
- Layer-Based Width for PAFP#819368
- The (Parameterized) Complexity of Ordering a Graph While Avoiding a Forbidden Pattern#818722
- The (Parameterized) Complexity of Ordering a Graph While Avoiding a Forbidden Pattern#808730
- A BGP Cease NOTIFICATION Subcode for Bidirectional Forwarding Detection (BFD)#502703
- Removable matchings in $2$-connected graphs#974996
Record · ID 809375
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