arXiv (OAI Expanded)
open access
Tight Hardness for Temporal Path Covers at Vertex-Cover Number Two
Temporal Path Cover (TPC) and Temporally Disjoint Path Cover (TDPC) ask for minimum-cardinality covers of a temporal digraph by temporal paths, with TDPC additionally requiring pairwise temporal disjointness. Cioni et al. proved both problems NP-hard on temporal DAGs whose underlying undirected grap
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
- TRISDUCTION: GEOMETRIC DETERMINATION OF P vs NP WITH OMEGA SEAL#691084
- Combinatorial slicing problems of polytopes: How (not) to reconstruct a polytope from its slices#1110572
- Multi-parameter analysis of finding minors and induced subgraphs in edge-periodic temporal graphs#1039056
- Deposon: An Auditable, Conservation-Guaranteed, Game-Theoretically Tested Scattering Layer over LLM Reasoning Paths#986613
- The Complexity of Recognizing SDP Exactness for the Maximum Cut Problem#1123200
Record · ID 1083371
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