Expected polynomial-time randomized algorithm for graph coloring problem
Authors:
- Subhankar GhosalSGSubhankar Ghosal
- Sasthi C. GhoshSGSasthi C. Ghosh
- 21 August 2023
- journal article
- research article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 354, 108-121
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Modified cuckoo optimization algorithm (MCOA) to solve graph coloring problemApplied Soft Computing, 2015
- Coloring graphs by iterated local search traversing feasible and infeasible solutionsDiscrete Applied Mathematics, 2008
- Constructive generation of very hard 3-colorability instancesDiscrete Applied Mathematics, 2007
- A survey of local search methods for graph coloringComputers & Operations Research, 2006
- Linear degree extractors and the inapproximability of max clique and chromatic number2006
- A Column Generation Approach for Graph ColoringINFORMS Journal on Computing, 1996
- Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number PartitioningOperations Research, 1991
- Using tabu search techniques for graph coloringComputing, 1987
- New methods to color the vertices of a graphCommunications of the ACM, 1979
- On the Geographical Problem of the Four ColoursAmerican Journal of Mathematics, 1879