The complexity of transitively orienting temporal graphs (Q7007130)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 8017309
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of transitively orienting temporal graphs |
scientific article; zbMATH DE number 8017309 |
Statements
The complexity of transitively orienting temporal graphs (English)
0 references
26 March 2025
0 references
temporal graph
0 references
transitive orientation
0 references
transitive closure
0 references
polynomial-time algorithm
0 references
NP-hardness
0 references
satisfiability
0 references
