pith. sign in

Title resolution pending

· 2024

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
browse 1 citing papers

Title metadata for this work has not finished resolving. The hub is built from the citation graph; the title resolver retries DOI and OpenAlex on its next pass.

fields

cs.DS 1

years

2026 1

verdicts

UNVERDICTED 1

representative citing papers

Minimum Temporal Spanners in Happy Graphs

cs.DS · 2026-04-27 · unverdicted · novelty 7.0

Minimum temporal spanner problem is NP-hard on happy temporal graphs and admits FPT algorithms under constant vertex cover in the happy case.

citing papers explorer

Showing 1 of 1 citing paper.

  • Minimum Temporal Spanners in Happy Graphs cs.DS · 2026-04-27 · unverdicted · none · ref 11

    Minimum temporal spanner problem is NP-hard on happy temporal graphs and admits FPT algorithms under constant vertex cover in the happy case.