Polynomial time algorithms for variants of graph matching on partial \(k\)-trees (Q1692069)
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 variants of graph matching on partial \(k\)-trees |
scientific article; zbMATH DE number 6829862
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial time algorithms for variants of graph matching on partial \(k\)-trees |
scientific article; zbMATH DE number 6829862 |
Statements
Polynomial time algorithms for variants of graph matching on partial \(k\)-trees (English)
0 references
26 January 2018
0 references
graph isomorphism with restriction
0 references
partial \(k\)-trees
0 references
polynomial time algorithm
0 references
0 references
0.9112424
0 references
0.8904183
0 references
0.8904183
0 references
0.8885642
0 references
