| Autor: |
Nagoya Takayuki |
| Jazyk: |
angličtina |
| Rok vydání: |
2016 |
| Předmět: |
|
| Zdroj: |
Foundations of Computing and Decision Sciences, Vol 41, Iss 3, Pp 163-181 (2016) |
| Druh dokumentu: |
article |
| ISSN: |
2300-3405 |
| DOI: |
10.1515/fcds-2016-0010 |
| Popis: |
In this paper, we deal with two variants of graph matching, the graph isomorphism with restriction and the prefix set of graph isomorphism. The former problem is known to be NP-complete, whereas the latter problem is known to be GI-complete. We propose polynomial time exact algorithms for these problems on partial k-trees. |
| Databáze: |
Directory of Open Access Journals |
| Externí odkaz: |
|
