Coloring of Double Disk Graphs

Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review

8 Scopus Citations
Scopus Metrics
View graph of relations

Author(s)

Related Research Unit(s)

Detail(s)

Original languageEnglish
Pages (from-to)115-119
Journal / PublicationJournal of Global Optimization
Volume28
Issue number1
Publication statusPublished - Jan 2004

Link(s)

DOI

DOI
Check@CityULib
Link to Scopus https://www.scopus.com/record/display.uri?eid=2-s2.0-0942277394&origin=recordpage
Permanent Link https://scholars.cityu.edu.hk/en/publications/publication(d3544089-c344-4c4e-83dc-15df71bbb1b1).html

Abstract

We study the problem of minimizing the number of colors for vertex-coloring of double disk graphs and in this note, show a polynomial-time 31-approximation for the problem, which improves an existing result.

Fingerprint

Publication fingerprints text

100
Coloring Computer Science
100
Double Disc Keyphrases
100
Disk Graph Keyphrases
100
graphs INIS
50
Approximation (Algo... Computer Science
50
Polynomial Time Computer Science
50
Vertex Coloring Keyphrases
50
Color number Keyphrases
50
approximations INIS
50
polynomials INIS
Full Fingerprint ›

Citation Format(s)

[ RIS ] [ BibTeX ]
Coloring of Double Disk Graphs. / Du, Hongwei; Jia, Xiaohua; Li, Deying et al.
In: Journal of Global Optimization, Vol. 28, No. 1, 01.2004, p. 115-119.

Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review