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

Published in: COCOON (1) (2023)

Keyphrases

data mining
optimization problems
machine learning
np complete
shortest path
application domains
problems involving
neural network
image segmentation
bayesian networks
high dimensional
decision problems
bipartite graph
random graphs
polynomial equations
min sum