An FPT Algorithm for the Embeddability of Graphs into Two-Dimensional Simplicial Complexes.
Éric Colin de VerdièreThomas MagnardPublished in: ESA (2021)
Keyphrases
- learning algorithm
- dynamic programming
- preprocessing
- special case
- cost function
- recognition algorithm
- computational cost
- worst case
- detection algorithm
- optimization algorithm
- theoretical analysis
- particle swarm optimization
- neural network
- graph structure
- computational complexity
- tree structure
- uniform distribution
- probabilistic model
- simulated annealing
- np hard
- significant improvement
- genetic algorithm