Polynomial Turing Compressions for Some Graph Problems Parameterized by Modular-Width.

Published in: CoRR (2022)

Keyphrases

neural network
optimization problems
pairwise
graph matching
solving problems
structured data
machine intelligence
data sets
feature selection
special case
knn
simulated annealing
random walk
benchmark problems
graph representation
shortest path problem