Complexity of tree homomorphisms (Q1923593)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 933107
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of tree homomorphisms |
scientific article; zbMATH DE number 933107 |
Statements
Complexity of tree homomorphisms (English)
0 references
18 August 1997
0 references
Let \(T\) be an oriented tree and consider the complexity of deciding whether or not a given digraph is homomorphic to \(T\). A class of simple trees with NP-complete homomorphism problems is identified, the smallest tree having 45 vertices. A list of all subtrees that are necessary in order to get NP-complete homomorphism problems for a tree is presented.
0 references
digraph
0 references
homomorphism problems
0 references
tree
0 references
0.8356441259384155
0 references
0.8034666776657104
0 references
0.7855942249298096
0 references
