본문 바로가기
  • Home

Notes On Inverse Interval Graph Coloring Problems

  • Journal of The Korea Society of Computer and Information
  • Abbr : JKSCI
  • 2019, 24(10), pp.57-64
  • DOI : 10.9708/jksci.2019.24.10.057
  • Publisher : The Korean Society Of Computer And Information
  • Research Area : Engineering > Computer Science
  • Received : August 27, 2019
  • Accepted : September 30, 2019
  • Published : October 31, 2019

Chung Yerim 1 Hak Jin Kim 1

1연세대학교

Accredited

ABSTRACT

In this paper, we study a polynomially solvable case of the inverse interval graph coloring problem. Given an interval graph associated with a specific interval system, the inverse interval graph coloring problem is defined with the assumption that there is no proper K-coloring for the given interval graph, where K is a fixed integer. The problem is to modify the system of intervals associated with the given interval graph by shifting some of the intervals in such a way that the resulting interval graph becomes K-colorable and the total modification is minimum with respect to a certain norm. In this paper, we focus on the case K=1 where all intervals associated with the interval graph have length 1 or 2, and interval displacement is only allowed to the righthand side with respect to its original position. To solve this problem in polynomial time, we propose a two-phase algorithm which consists of the sorting and First Fit procedure.

Citation status

* References for papers published after 2023 are currently being built.