Preprocessing Complexity for Some Graph Problems Parameterized by Structural Parameters.

Manuel Lafond Weidong Luo

Published in: CoRR (2023)

Keyphrases

preprocessing
polynomial time complexity
np complete
decision problems
worst case
random walk
parameter estimation
graph structure
search algorithm
computational complexity
directed graph
data mining
genetic algorithm
post processing
graph partitioning
highly non linear