Lettericity of graphs: an FPT algorithm and a bound on the size of obstructions.
Bogdan AlecuMamadou Moustapha KantéVadim V. LozinViktor ZamaraevPublished in: CoRR (2024)
Keyphrases
- learning algorithm
- computational complexity
- computational cost
- memory requirements
- matching algorithm
- worst case
- dynamic programming
- scales linearly
- detection algorithm
- theoretical analysis
- graph structure
- fixed size
- cost function
- lower bound
- optimal solution
- objective function
- error bounds
- segmentation algorithm
- neural network
- expectation maximization
- space complexity
- linear programming
- preprocessing
- graph isomorphism
- graph theory
- graph matching
- convergence rate
- np complete
- particle swarm optimization
- np hard
- similarity measure
- genetic algorithm