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...

תיאור מלא

מידע ביבליוגרפי

Principais autores:	Selman Yakut, Erkan Karagoz
פורמט:	Artigo
שפה:	Inglês
יצא לאור:	IEEE 2025-01-01
סדרה:	IEEE Access
נושאים:	Centrality-driven heuristics graph coloring for sudoku large-scale sudoku optimization Malatya centrality algorithm NP-complete problem solving
גישה מקוונת:	https://ieeexplore.ieee.org/document/11205359/
תגים:	הוספת תג אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!