Last-Fit Greedy Coloring Algorithm for Interval Graphs

摘要

A greeding coloring algoritm for interval graphs that colors as many vertices aspossible using k colors is discussed. Given a specific ordering of the vertices, the algorithm always tries to color a vertex with the last used color among the feasible colors.