n algorithm for k-cycle in minor-closed graph families.

Published in: CoRR (2020)

Keyphrases

learning algorithm
cost function
matching algorithm
optimal solution
preprocessing
dynamic programming
adjacency graph
graph based algorithm
times faster

graph model
shortest path problem
recognition algorithm
tree structure
shortest path
detection algorithm
expectation maximization
simulated annealing

high accuracy
worst case
maximum flow
experimental evaluation
np hard
breadth first search
objective function
minimum spanning tree

particle swarm optimization
graph structure
graph theory
probabilistic model
computational cost
significant improvement
k means
similarity measure