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

From MaRDI portal
Publication:6122608

DOI10.1016/j.tcs.2024.114434OpenAlexW4391578353WikidataQ128542593 ScholiaQ128542593MaRDI QIDQ6122608

Arnaud Casteigts, Timothée Corsini, Writika Sarkar

Publication date: 1 March 2024

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2024.114434






Cites Work


This page was built for publication: Simple, strict, proper, happy: a study of reachability in temporal graphs