Faster algorithms for quantitative verification in bounded treewidth graphs (Q2058390)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Faster algorithms for quantitative verification in bounded treewidth graphs |
scientific article |
Statements
Faster algorithms for quantitative verification in bounded treewidth graphs (English)
0 references
8 December 2021
0 references
quantitative verification
0 references
minimum mean cycle
0 references
minimum ratio cycle
0 references
constant treewidth graphs
0 references
initial credit for energy
0 references
0 references
0 references
