An FPT algorithm for the embeddability of graphs into two-dimensional simplicial complexes.
Éric Colin de VerdièreThomas MagnardPublished in: CoRR (2021)
Keyphrases
- significant improvement
- optimal solution
- np hard
- matching algorithm
- theoretical analysis
- computational complexity
- dynamic programming
- learning algorithm
- recognition algorithm
- cost function
- k means
- preprocessing
- objective function
- segmentation algorithm
- random graphs
- graph structure
- neural network
- graph matching
- convergence rate
- weighted graph
- graph isomorphism
- tree structure
- clustering method
- worst case
- probabilistic model
- computational cost
- image segmentation