Simple, strict, proper, happy: A study of reachability in temporal graphs
| Autor: | Casteigts, Arnaud, Corsini, Timothée, Sarkar, Writika |
|---|---|
| Zdroj: | In Theoretical Computer Science 12 April 2024 991 |
| Databáze: | ScienceDirect |
| Externí odkaz: |
|
| Autor: | Casteigts, Arnaud, Corsini, Timothée, Sarkar, Writika |
|---|---|
| Zdroj: | In Theoretical Computer Science 12 April 2024 991 |
| Databáze: | ScienceDirect |
| Externí odkaz: |
|
Full Text from ScienceDirect