(2, 1, 1)-Labeling Is NP-Complete for Trees.
Petr A. GolovachBernard LidickýDaniël PaulusmaPublished in: TAMC (2010)
Keyphrases
- np complete
- randomly generated
- np hard
- decision trees
- pspace complete
- computational complexity
- satisfiability problem
- constraint satisfaction problems
- data complexity
- image segmentation
- conjunctive queries
- tree structure
- active learning
- phase transition
- tree structures
- tree construction
- conp complete
- machine learning
- tree automata
- image labeling
- binary images
- labeling process