Polynomial-time approximation schemes for induced subgraph problems on fractionally tree-independence-number-fragile graphs.
Esther GalbyAndrea MunaroShizhou YangPublished in: CoRR (2024)
Keyphrases
- approximation schemes
- polynomial time complexity
- approximation algorithms
- np complete
- computational complexity
- graph mining
- np hard
- special case
- graph databases
- undirected graph
- numerical methods
- bounded degree
- upper bound
- deformable models
- graph matching
- leaf nodes
- subgraph isomorphism
- image analysis
- image processing