A polynomial time algorithm for geodetic hull number for complementary prisms.
Erika M. M. CoelhoHebert CoelhoJulliano R. NascimentoJayme Luiz SzwarcfiterPublished in: RAIRO Theor. Informatics Appl. (2022)
Keyphrases
- computational complexity
- polynomial time complexity
- worst case
- experimental evaluation
- computational cost
- dynamic programming
- computational effort
- segmentation algorithm
- detection algorithm
- execution times
- cost function
- np complete
- high accuracy
- times faster
- preprocessing
- space complexity
- objective function
- ant colony optimization
- neural network
- particle swarm optimization
- query complexity
- np hard
- significant improvement
- k means
- optimal solution
- randomized algorithm
- single scan
- initial set
- strongly polynomial
- approximation algorithms
- memory requirements
- convex hull
- matching algorithm
- optimization algorithm
- linear programming
- small number
- scheduling problem
- similarity measure