The Complexity of the List Homomorphism Problem for Graphs.

László Egri Andrei A. Krokhin Benoît Larose Pascal Tesson

Published in: STACS (2010)

Keyphrases

worst case
graph matching
computational complexity
database
graph theory
upper bound
polynomial time complexity
random graphs
graph theoretic
space complexity
graph mining
decision problems
bayesian networks
image segmentation
website
web pages
feature selection
neural network
databases
data sets