Spy game: FPT-algorithm, hardness and graph products.
Eurinardo Rodrigues CostaNicolas Almeida MartinsRudini SampaioPublished in: CoRR (2021)
Keyphrases
- dynamic programming
- np hard
- learning algorithm
- computational complexity
- graph structure
- computational cost
- worst case
- k means
- graph based algorithm
- preprocessing
- optimal solution
- cost function
- matching algorithm
- clustering algorithm
- depth first search
- graph model
- objective function
- bipartite graph
- graph matching
- spectral clustering
- video games
- tree structure
- segmentation algorithm
- random walk
- probabilistic model
- search space