Polynomial-Time Algorithms for Subgraph Isomorphism in Small Graph Classes of Perfect Graphs (Q5410645)
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: Polynomial-Time Algorithms for Subgraph Isomorphism in Small Graph Classes of Perfect Graphs |
scientific article; zbMATH DE number 6286272
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial-Time Algorithms for Subgraph Isomorphism in Small Graph Classes of Perfect Graphs |
scientific article; zbMATH DE number 6286272 |
Statements
Polynomial-Time Algorithms for Subgraph Isomorphism in Small Graph Classes of Perfect Graphs (English)
0 references
16 April 2014
0 references
subgraph isomorphism
0 references
graph class
0 references
polynomial-time algorithm
0 references
NP-completeness
0 references
1.0000002
0 references
0.91487575
0 references
0 references
0.89143157
0 references
0.88772196
0 references
0.8849223
0 references
