Simple, strict, proper, happy: A study of reachability in temporal graphs

Arnaud Casteigts, Timothée Corsini, Writika Sarkar. Simple, strict, proper, happy: A study of reachability in temporal graphs. Theoretical Computer Science, 991:114434, 2024. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.