arXiv (All)
open access
Parameterized Complexity of Temporal Connected Components
We study the parameterized complexity of maximum temporal connected components (tccs) in temporal graphs, that is, graphs whose edges are available only at specific points in time. In a tcc, every pair of vertices must be able to reach one another via time-respecting paths. We consider both maximum
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
- Structured connectivity for structured sequential computations#633091
- Distributed Continuous-Time Optimization on the Special Orthogonal Group SO(3) over Tree Interaction Graphs#1033811
- Complexity of Mathematics in the Real World.#487619
- Competitive interactions shape mammalian brain network dynamics and computation#5599
- Competitive interactions shape mammalian brain network dynamics and computation.#1250
Record · ID 1217328
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