Characterizing the complexity of subgraph isomorphism for graphs of bounded path-width (Q4593952)
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: Characterizing the complexity of subgraph isomorphism for graphs of bounded path-width |
scientific article; zbMATH DE number 6807575
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.9324185848236084
0 references
0.8282554149627686
0 references
0.8176609873771667
0 references
0.8128582239151001
0 references
