arXiv (All)
open access
Minimum Temporal Spanners in Happy Graphs
Temporal graphs are graphs whose edge set changes over discrete time steps. These graphs can model scenarios related to transportation, scheduling, social networks, and networking algorithms. A temporal graph is temporally connected (TC) if all pairs of vertices can reach each other using paths that
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
- MISFORTUNE OF QUALITATIVE SOCIAL RESEARCH IN THE TIMES OF ACADEMIC CAPITALISM#1098555
- Employees with temporary contracts - annual data#816335
- Costly Contracting in a Long-Term Relationship#942213
- Aggregation of Resource ReSerVation Protocol (RSVP) Reservations over MPLS TE/DS-TE Tunnels#500811
- On the Non-Derivability and Non-Necessity of Order, Time, and Causality in Theoretical Constructions#722326
Record · ID 1105021
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