Coloring of Double Disk Graphs

  • Authors:

  • Hongwei Du;Xiaohua Jia;Deying Li;Weili Wu

  • Affiliations:

  • Department of Computer Science, Huazhong Normal University, Wuhan, China;Department of Computer Science, City University of Hong Kong, Kowloon Tong, Hong Kong, (E-mail: jia@cs.cityu.edu.hk);Department of Computer Science, City University of Hong Kong, Kowloon Tong, Hong Kong, (E-mail: dyli@cs.cityu.edu.hk);Department of Computer Science, University of Texas at Dallas, Richardson, TX 75083, USA, (E-mail: weiliwu@utdallas.edu)

  • Venue:
  • Journal of Global Optimization
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

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.