Complexity results and algorithms for representing paths in digraphs (Q6851436)
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 8166054
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity results and algorithms for representing paths in digraphs |
scientific article; zbMATH DE number 8166054 |
Statements
Complexity results and algorithms for representing paths in digraphs (English)
0 references
27 February 2026
0 references
graph string matching
0 references
computational complexity
0 references
parameterized complexity
0 references
algorithms
0 references
