A theoretical analysis of backtracking in the graph coloring problem
- 30 June 1985
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 6 (2) , 275-282
- https://doi.org/10.1016/0196-6774(85)90044-6
Abstract
No abstract availableKeywords
This publication has 1 reference indexed in Scilit:
- Backtrack: An O(1) expected time algorithm for the graph coloring problemInformation Processing Letters, 1984