Simple, strict, proper, happy: a study of reachability in temporal graphs (Q6122608): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.tcs.2024.114434 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.TCS.2024.114434 / rank | |||
Normal rank | |||
Latest revision as of 18:39, 30 December 2024
scientific article; zbMATH DE number 7811881
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Simple, strict, proper, happy: a study of reachability in temporal graphs |
scientific article; zbMATH DE number 7811881 |
Statements
Simple, strict, proper, happy: a study of reachability in temporal graphs (English)
0 references
1 March 2024
0 references
temporal graphs
0 references
temporal reachability
0 references
reachability graph
0 references
expressivity
0 references
