Simple, strict, proper, happy: a study of reachability in temporal graphs (Q6122608)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Simple, strict, proper, happy: a study of reachability in temporal graphs |
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
