Characterizing the complexity of subgraph isomorphism for graphs of bounded path-width (Q4593952)
From MaRDI portal
scientific article; zbMATH DE number 6807575
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Characterizing the complexity of subgraph isomorphism for graphs of bounded path-width |
scientific article; zbMATH DE number 6807575 |
Statements
Characterizing the complexity of subgraph isomorphism for graphs of bounded path-width (English)
0 references
16 November 2017
0 references
