Polynomial-time algorithms for subgraph isomorphism in small graph classes of perfect graphs (Q896655)
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 6519403
| 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 6519403 |
Statements
Polynomial-time algorithms for subgraph isomorphism in small graph classes of perfect graphs (English)
0 references
10 December 2015
0 references
subgraph isomorphism
0 references
graph class
0 references
polynomial-time algorithm
0 references
NP-completeness
0 references
