Improving the performance of graph coloring algorithms through backtracking

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5101 LNCS, Issue PART 1, 2008, Pages 873-882

  Bhowmick, Sanjukta ^a   Hovland, Paul D ^b  

^a The Pennsylvania State University   (United States)

^b ARGONNE NATIONAL LABORATORY   (United States)

Author keywords

Backtracking; Graph coloring

Indexed keywords

BACKTRACKING ALGORITHMS; COLORING ALGORITHMS; COMPUTATIONAL SCIENCES; CORRECTION ALGORITHMS; ENGINEERING PROBLEMS; GRAPH COLORINGS; GREEDY METHOD; HEIDELBERG (CO); INTERNATIONAL CONFERENCES; NP COMPLETE PROBLEMS; OF GRAPHS; OPTIMAL COLORING; OPTIMAL NUMBER; PERMUTATION (PERM); VARIATIONS OF;

ALGORITHMS; BOOLEAN FUNCTIONS; COLOR; COLORING; COMPUTATIONAL GEOMETRY; DYNAMICS; ELECTROPHORESIS; GRAPH THEORY; HEURISTIC ALGORITHMS; HEURISTIC METHODS; MATHEMATICAL TRANSFORMATIONS; MOLECULAR DYNAMICS; NUCLEAR PROPULSION; NUCLEIC ACIDS; OPTICAL PROPERTIES; ORGANIC ACIDS; QUANTUM CHEMISTRY; STANDARDS;

HEURISTIC PROGRAMMING;

EID: 47749150031     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-69384-0_92     Document Type: Conference Paper

References (10)

1. Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York (1979)
2. Siek, J.G., Lee, L., Lumsdaine, A.: Boost Graph Library, The: User Guide and Reference Manual. Addison Wesley Professional, Reading (2001)
3. Culberson, J.C.: Iterated Greedy Graph Coloring and the Difficulty Landscape. Technical Report (1992)
4. Carloni, P.: PDB Coordinates for HIV-1 Nef binding to Thioesterase ii, http://www.sissa.it/sbp/be/publications/publications.html
5. Davis, T.: University of Florida Sparse Matrix Collection (1997), http://www.cise.ufl.edu/research/sparse/matrices
6. Gross, J.L., Yellen, J.: Handbook of Graph Theory and Applications. CRC Press, Boca Raton (2004)
7. Gebremdhin, A., Manne, F., Pothen, A.: What color is your Jacobian? Graph coloring for Computing Derivatives. SIAM Review 47, 629-705 (2005)
8. Welsh, D.J.A., Powell, M.B.: An upper bound for the chromatic number of a graph and its application to timetabling problems. Computer J., 85-86 (1967)
9. Matula, D.W.: A min-max theorem for graphs with application to graph coloring. SIAM Review, 481-482 (1968)
10. Coleman, T., Moré, J.J.: Estimation of Sparse Jacobian Matrices and Graph Coloring Problems. SIAM Journal of Numerical Analysis 20(1), 187-209 (1983)