On restricted disjunctive temporal problems: faster algorithms and tractability frontier (Q5079776)
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 7533373
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On restricted disjunctive temporal problems: faster algorithms and tractability frontier |
scientific article; zbMATH DE number 7533373 |
Statements
28 May 2022
0 references
restricted disjuctive temporal problems
0 references
simple temporal networks
0 references
hyper-temporal networks
0 references
consistency checking
0 references
single-source shortest-paths
0 references
2-SAT
0 references
0 references
0 references
On Restricted Disjunctive Temporal Problems: Faster Algorithms and Tractability Frontier (English)
0 references
0.7511257529258728
0 references
0.7480560541152954
0 references
0.7429872155189514
0 references
0.740655243396759
0 references
0.7391526699066162
0 references
