FPT algorithms for domination in sparse graphs and beyond.

Jan Arne Telle Yngve Villanger

Published in: Theor. Comput. Sci. (2019)

Keyphrases

graph theory
significant improvement
computational complexity
optimization problems
theoretical analysis
genetic algorithm
computational cost
worst case
orders of magnitude
data mining
computationally efficient
benchmark datasets
graph search
maximum clique