An \(O(n^2)\) time algorithm for alternating Büchi games (Q5743484)
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 7053361
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An \(O(n^2)\) time algorithm for alternating Büchi games |
scientific article; zbMATH DE number 7053361 |
Statements
10 May 2019
0 references
graph games
0 references
Büchi objectives
0 references
graph algorithms
0 references
dynamic graph algorithms
0 references
computer-aided verification
0 references
0 references
0 references
0.9449557662010192
0 references
0.8263821601867676
0 references
0.7961139678955078
0 references
0.7754773497581482
0 references
