On maximum differential graph coloring

Yifan Hu, Stephen G Kobourov, Sankar Veeramoni

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

10 Citations (Scopus)

Abstract

We study the maximum differential graph coloring problem, in which the goal is to find a vertex labeling for a given undirected graph that maximizes the label difference along the edges. This problem has its origin in map coloring, where not all countries are necessarily contiguous. We define the differential chromatic number and establish the equivalence of the maximum differential coloring problem to that of k-Hamiltonian path. As computing the maximum differential coloring is NP-Complete, we describe an exact backtracking algorithm and a spectral-based heuristic. We also discuss lower bounds and upper bounds for the differential chromatic number for several classes of graphs.

Original languageEnglish (US)
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages274-286
Number of pages13
Volume6502 LNCS
DOIs
StatePublished - 2011
Event18th International Symposium on Graph Drawing, GD 2010 - Konstanz, Germany
Duration: Sep 21 2010Sep 24 2010

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6502 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other18th International Symposium on Graph Drawing, GD 2010
CountryGermany
CityKonstanz
Period9/21/109/24/10

Fingerprint

Graph Coloring
Coloring
Colouring
Chromatic number
Hamiltonians
Vertex Labeling
Hamiltonian path
Labeling
Backtracking
Labels
Undirected Graph
NP-complete problem
Maximise
Equivalence
Heuristics
Lower bound
Upper bound
Computing
Graph in graph theory

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Hu, Y., Kobourov, S. G., & Veeramoni, S. (2011). On maximum differential graph coloring. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6502 LNCS, pp. 274-286). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6502 LNCS). https://doi.org/10.1007/978-3-642-18469-7_25

On maximum differential graph coloring. / Hu, Yifan; Kobourov, Stephen G; Veeramoni, Sankar.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6502 LNCS 2011. p. 274-286 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6502 LNCS).

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

Hu, Y, Kobourov, SG & Veeramoni, S 2011, On maximum differential graph coloring. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 6502 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6502 LNCS, pp. 274-286, 18th International Symposium on Graph Drawing, GD 2010, Konstanz, Germany, 9/21/10. https://doi.org/10.1007/978-3-642-18469-7_25
Hu Y, Kobourov SG, Veeramoni S. On maximum differential graph coloring. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6502 LNCS. 2011. p. 274-286. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-18469-7_25
Hu, Yifan ; Kobourov, Stephen G ; Veeramoni, Sankar. / On maximum differential graph coloring. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6502 LNCS 2011. pp. 274-286 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{8a7f68c6e53d4787b02eb5dec27c5bf9,
title = "On maximum differential graph coloring",
abstract = "We study the maximum differential graph coloring problem, in which the goal is to find a vertex labeling for a given undirected graph that maximizes the label difference along the edges. This problem has its origin in map coloring, where not all countries are necessarily contiguous. We define the differential chromatic number and establish the equivalence of the maximum differential coloring problem to that of k-Hamiltonian path. As computing the maximum differential coloring is NP-Complete, we describe an exact backtracking algorithm and a spectral-based heuristic. We also discuss lower bounds and upper bounds for the differential chromatic number for several classes of graphs.",
author = "Yifan Hu and Kobourov, {Stephen G} and Sankar Veeramoni",
year = "2011",
doi = "10.1007/978-3-642-18469-7_25",
language = "English (US)",
isbn = "9783642184680",
volume = "6502 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "274--286",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - On maximum differential graph coloring

AU - Hu, Yifan

AU - Kobourov, Stephen G

AU - Veeramoni, Sankar

PY - 2011

Y1 - 2011

N2 - We study the maximum differential graph coloring problem, in which the goal is to find a vertex labeling for a given undirected graph that maximizes the label difference along the edges. This problem has its origin in map coloring, where not all countries are necessarily contiguous. We define the differential chromatic number and establish the equivalence of the maximum differential coloring problem to that of k-Hamiltonian path. As computing the maximum differential coloring is NP-Complete, we describe an exact backtracking algorithm and a spectral-based heuristic. We also discuss lower bounds and upper bounds for the differential chromatic number for several classes of graphs.

AB - We study the maximum differential graph coloring problem, in which the goal is to find a vertex labeling for a given undirected graph that maximizes the label difference along the edges. This problem has its origin in map coloring, where not all countries are necessarily contiguous. We define the differential chromatic number and establish the equivalence of the maximum differential coloring problem to that of k-Hamiltonian path. As computing the maximum differential coloring is NP-Complete, we describe an exact backtracking algorithm and a spectral-based heuristic. We also discuss lower bounds and upper bounds for the differential chromatic number for several classes of graphs.

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

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

U2 - 10.1007/978-3-642-18469-7_25

DO - 10.1007/978-3-642-18469-7_25

M3 - Conference contribution

AN - SCOPUS:79952264539

SN - 9783642184680

VL - 6502 LNCS

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

SP - 274

EP - 286

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

ER -