On the complexity of the 3-kernel problem in some classes of digraphs.
Pavol HellCésar Hernández-CruzPublished in: Discuss. Math. Graph Theory (2014)
Keyphrases
- tractable cases
- complexity measures
- equivalence classes
- kernel function
- directed graph
- kernel methods
- hidden markov models
- database
- space complexity
- computational complexity
- information retrieval
- worst case
- image classification
- decision problems
- lower bound
- object recognition
- kernel learning
- social networks
- intrinsic complexity