A Graph-Theoretic Solution to NP-Complete Sudoku Puzzles: Malatya Centrality for Large-Scale Optimization
The sudoku puzzle, an NP-complete problem, presents significant computational challenges due to its constrained structure and vast solution space. While widely studied in artificial intelligence and optimization, existing methods often struggle with scalability and varying difficulty levels. This st...
Na minha lista:
| Principais autores: | , |
|---|---|
| Format: | Artigo |
| Sprog: | Inglês |
| Udgivet: |
IEEE
2025-01-01
|
| Serier: | IEEE Access |
| Fag: | |
| Online adgang: | https://ieeexplore.ieee.org/document/11205359/ |
| Tags: |
Ingen Tags, Vær først til at tagge denne postø!
|