Subexponential algorithms for variants of the homomorphism problem in string graphs.

Karolina Okrasa Pawel Rzazewski

Published in: J. Comput. Syst. Sci. (2020)

Keyphrases

data structure
related algorithms
computational complexity
theoretical analysis
graph theory
computational cost
machine learning algorithms
orders of magnitude
graph theoretic
max cut
learning algorithm
feature selection
significant improvement
suffix tree
exact and approximate