In the paper we consider the problems of equitable and semi-equitable coloring of vertices of cubic graphs. We show that in contrast to the equitable coloring, which is easy, the problem of semi-equitable coloring is NP-complete within a broad spectrum of graph parameters. This affects the complexity of batch scheduling of unit-length jobs with cubic incompatibility graph on three uniform processors to minimize the makespan.
机构:
Univ Gdansk, Inst Informat, Fac Math Phys & Informat, Wita Stwosza 57, PL-80308 Gdansk, PolandUniv Gdansk, Inst Informat, Fac Math Phys & Informat, Wita Stwosza 57, PL-80308 Gdansk, Poland
Furmanczyk, Hanna
Zuazua, Rita
论文数: 0引用数: 0
h-index: 0
机构:
Univ Nacl Autonoma Mexico, Dept Math, Fac Sci, Ciudad Univ, Mexico City 04510, DF, MexicoUniv Gdansk, Inst Informat, Fac Math Phys & Informat, Wita Stwosza 57, PL-80308 Gdansk, Poland
机构:
Tel Aviv Univ, Raymond & Beverly Sackler Fac Exact Sci, Sch Math Sci, IL-69978 Tel Aviv, IsraelCent European Univ, Dept Math & Its Applicat, H-1051 Budapest, Hungary
Krivelevich, Michael
Patkos, Balazs
论文数: 0引用数: 0
h-index: 0
机构:
Cent European Univ, Dept Math & Its Applicat, H-1051 Budapest, HungaryCent European Univ, Dept Math & Its Applicat, H-1051 Budapest, Hungary
机构:
Indian Stat Inst, Comp Sci Unit, Chennai Ctr, Madras 600113, Tamil Nadu, IndiaIndian Stat Inst, Comp Sci Unit, Chennai Ctr, Madras 600113, Tamil Nadu, India
Karthick, T.
AUSTRALASIAN JOURNAL OF COMBINATORICS,
2014,
59
: 251
-
259