arXiv (All)
open access
On the Hardness of Finding Temporally Connected Subgraphs of Any Size
Temporal graphs are graphs whose edges are present only at certain points in time. Reachability in these graphs is defined via temporal paths, in which edges are traversed in increasing chronological order. A temporal graph is temporally connected (or TC) if every ordered pair of vertices is connect
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
- Autocatalytic order controls bistability in a conservative kinetic model of relational event progression#1326052
- Countable Graphs with Finite Path-width: Characterisation and Universality#781047
- Countable Graphs with Finite Path-width: Characterisation and Universality#779672
- Are There Occurrent Continuants? A Reply to Stout’s “The Category of Occurrent Continuants”#726409
- Temporal Order as Directional Relational Structure: Entanglement, Decoherence, and the Emergence of Time#695100
Record · ID 1327366
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