Another look at graph coloring via propositional satisfiability
Author:
- Allen Van GelderAGAllen Van Gelder
- 1 January 2008
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 156 (2) , 230-243
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Graph coloring in the estimation of sparse derivative matrices: Instances and applicationsDiscrete Applied Mathematics, 2008
- Frozen development in graph coloringTheoretical Computer Science, 2001
- Controlled integration of the cut rule into connection tableau calculiJournal of Automated Reasoning, 1994
- An efficient algorithm for the 3-satisfiability problemOperations Research Letters, 1992
- Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number PartitioningOperations Research, 1991
- Using tabu search techniques for graph coloringComputing, 1987
- An extension to linear resolution with selection functionInformation Processing Letters, 1982
- A graph coloring algorithm for large scheduling problemsJournal of Research of the National Bureau of Standards, 1979
- A Simplified Format for the Model Elimination Theorem-Proving ProcedureJournal of the ACM, 1969
- A machine program for theorem-provingCommunications of the ACM, 1962