Improving the performance of graph coloring algorithms through backtracking

Sanjukta Bhowmick, Paul D. Hovland

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

Abstract

Graph coloring is used to identify independent objects in a set and has applications in a wide variety of scientific and engineering problems. Optimal coloring of graphs is an NP-complete problem. Therefore there exist many heuristics that attempt to obtain a near-optimal number of colors. In this paper we introduce a backtracking correction algorithm which dynamically rearranges the colors assigned by a top level heuristic to a more favorable permutation thereby improving the performance of the coloring algorithm. Our results obtained by applying the backtracking heuristic on graphs from molecular dynamics and DNA-electrophoresis show that the backtracking algorithm succeeds in lowering the number of colors by as much as 23%. Variations of backtracking algorithm can be as much as 66% faster than standard correction algorithms, like Culberson's Iterated Greedy method, while producing a comparable number of colors.

Original languageEnglish (US)
Title of host publicationComputational Science - ICCS 2008 - 8th International Conference, Proceedings
Pages873-882
Number of pages10
EditionPART 1
DOIs
StatePublished - Jul 28 2008
Event8th International Conference on Computational Science, ICCS 2008 - Krakow, Poland
Duration: Jun 23 2008Jun 25 2008

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
NumberPART 1
Volume5101 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference8th International Conference on Computational Science, ICCS 2008
CountryPoland
CityKrakow
Period6/23/086/25/08

Fingerprint

Backtracking
Graph Coloring
Coloring
Color
Heuristics
Colouring
Molecular Dynamics Simulation
Graph in graph theory
Electrophoresis
Molecular Dynamics
Molecular dynamics
Computational complexity
Permutation
DNA
NP-complete problem
Engineering

Keywords

  • Backtracking
  • Graph coloring

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Bhowmick, S., & Hovland, P. D. (2008). Improving the performance of graph coloring algorithms through backtracking. In Computational Science - ICCS 2008 - 8th International Conference, Proceedings (PART 1 ed., pp. 873-882). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5101 LNCS, No. PART 1). https://doi.org/10.1007/978-3-540-69384-0_92

Improving the performance of graph coloring algorithms through backtracking. / Bhowmick, Sanjukta; Hovland, Paul D.

Computational Science - ICCS 2008 - 8th International Conference, Proceedings. PART 1. ed. 2008. p. 873-882 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5101 LNCS, No. PART 1).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Bhowmick, S & Hovland, PD 2008, Improving the performance of graph coloring algorithms through backtracking. in Computational Science - ICCS 2008 - 8th International Conference, Proceedings. PART 1 edn, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), no. PART 1, vol. 5101 LNCS, pp. 873-882, 8th International Conference on Computational Science, ICCS 2008, Krakow, Poland, 6/23/08. https://doi.org/10.1007/978-3-540-69384-0_92
Bhowmick S, Hovland PD. Improving the performance of graph coloring algorithms through backtracking. In Computational Science - ICCS 2008 - 8th International Conference, Proceedings. PART 1 ed. 2008. p. 873-882. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 1). https://doi.org/10.1007/978-3-540-69384-0_92
Bhowmick, Sanjukta ; Hovland, Paul D. / Improving the performance of graph coloring algorithms through backtracking. Computational Science - ICCS 2008 - 8th International Conference, Proceedings. PART 1. ed. 2008. pp. 873-882 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 1).
@inproceedings{136393b159bc4a258ed2a9a6a6c1d36a,
title = "Improving the performance of graph coloring algorithms through backtracking",
abstract = "Graph coloring is used to identify independent objects in a set and has applications in a wide variety of scientific and engineering problems. Optimal coloring of graphs is an NP-complete problem. Therefore there exist many heuristics that attempt to obtain a near-optimal number of colors. In this paper we introduce a backtracking correction algorithm which dynamically rearranges the colors assigned by a top level heuristic to a more favorable permutation thereby improving the performance of the coloring algorithm. Our results obtained by applying the backtracking heuristic on graphs from molecular dynamics and DNA-electrophoresis show that the backtracking algorithm succeeds in lowering the number of colors by as much as 23{\%}. Variations of backtracking algorithm can be as much as 66{\%} faster than standard correction algorithms, like Culberson's Iterated Greedy method, while producing a comparable number of colors.",
keywords = "Backtracking, Graph coloring",
author = "Sanjukta Bhowmick and Hovland, {Paul D.}",
year = "2008",
month = "7",
day = "28",
doi = "10.1007/978-3-540-69384-0_92",
language = "English (US)",
isbn = "3540693831",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
number = "PART 1",
pages = "873--882",
booktitle = "Computational Science - ICCS 2008 - 8th International Conference, Proceedings",
edition = "PART 1",

}

TY - GEN

T1 - Improving the performance of graph coloring algorithms through backtracking

AU - Bhowmick, Sanjukta

AU - Hovland, Paul D.

PY - 2008/7/28

Y1 - 2008/7/28

N2 - Graph coloring is used to identify independent objects in a set and has applications in a wide variety of scientific and engineering problems. Optimal coloring of graphs is an NP-complete problem. Therefore there exist many heuristics that attempt to obtain a near-optimal number of colors. In this paper we introduce a backtracking correction algorithm which dynamically rearranges the colors assigned by a top level heuristic to a more favorable permutation thereby improving the performance of the coloring algorithm. Our results obtained by applying the backtracking heuristic on graphs from molecular dynamics and DNA-electrophoresis show that the backtracking algorithm succeeds in lowering the number of colors by as much as 23%. Variations of backtracking algorithm can be as much as 66% faster than standard correction algorithms, like Culberson's Iterated Greedy method, while producing a comparable number of colors.

AB - Graph coloring is used to identify independent objects in a set and has applications in a wide variety of scientific and engineering problems. Optimal coloring of graphs is an NP-complete problem. Therefore there exist many heuristics that attempt to obtain a near-optimal number of colors. In this paper we introduce a backtracking correction algorithm which dynamically rearranges the colors assigned by a top level heuristic to a more favorable permutation thereby improving the performance of the coloring algorithm. Our results obtained by applying the backtracking heuristic on graphs from molecular dynamics and DNA-electrophoresis show that the backtracking algorithm succeeds in lowering the number of colors by as much as 23%. Variations of backtracking algorithm can be as much as 66% faster than standard correction algorithms, like Culberson's Iterated Greedy method, while producing a comparable number of colors.

KW - Backtracking

KW - Graph coloring

UR - http://www.scopus.com/inward/record.url?scp=47749150031&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=47749150031&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-69384-0_92

DO - 10.1007/978-3-540-69384-0_92

M3 - Conference contribution

SN - 3540693831

SN - 9783540693833

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

SP - 873

EP - 882

BT - Computational Science - ICCS 2008 - 8th International Conference, Proceedings

ER -