Linear Time Algorithms for NP-hard Problems restricted to GaTEx Graphs.

Marc Hellmuth Guillaume E. Scholz

Published in: CoRR (2023)

Keyphrases

np hard problems
constraint programming
knapsack problem
combinatorial search
special case
np hard
graph coloring
computational complexity
scheduling problem
optimization problems
benchmark problems
subgraph isomorphism