Polynomial time algorithms for variants of graph matching on partial \(k\)-trees (Q1692069): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1515/fcds-2016-0010 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2526117656 / rank | |||
Normal rank | |||
Revision as of 02:08, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial time algorithms for variants of graph matching on partial \(k\)-trees |
scientific article |
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
