Faster algorithms for algebraic path properties in recursive state machines with constant treewidth (Q2819794)
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: Faster algorithms for algebraic path properties in recursive state machines with constant treewidth |
scientific article; zbMATH DE number 6631293
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Faster algorithms for algebraic path properties in recursive state machines with constant treewidth |
scientific article; zbMATH DE number 6631293 |
Statements
29 September 2016
0 references
constant treewidth graphs
0 references
dataflow analysis
0 references
interprocedural analysis
0 references
reachability and shortest path
0 references
Faster algorithms for algebraic path properties in recursive state machines with constant treewidth (English)
0 references
0.8515752553939819
0 references
0.8241630792617798
0 references
0.7486931085586548
0 references
0.7334371209144592
0 references
