Feasible edge colorings of trees with cardinality constraints

被引：8
|
作者：
de Werra, D
Hertz, A [1 ]
Kobler, D
Mahadev, NVR
机构：
[1] Ecole Polytech Fed Lausanne, Dept Math, CH-1015 Lausanne, Switzerland
[2] Northeastern Univ, Boston, MA 02115 USA
来源：
DISCRETE MATHEMATICS | 2000年 / 222卷 / 1-3期
关键词：
edge coloring; open shop; cost; timetabling; feasible colors; cardinality constraints;
D O I：
10.1016/S0012-365X(00)00006-6
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
A variation of preemptive open shop scheduling corresponds to finding a feasible edge coloring in a bipartite multigraph with some requirements on the size of the different color classes, We show that for trees with fixed maximum degree, one can find in polynomial time an edge k-coloring where for i = 1,,..,k the number of edges of color i is exactly a given number h(i), and each edge e gets its color from a set phi(e) of feasible colors, if such a coloring exists. This problem is NP-complete for general bipartite multigraphs. Applications to open shop problems with costs for using colors are described. (C) 2000 Elsevier Science B.V. All rights reserved.
引用
收藏
页码：61 / 72
页数：12
相关论文
共 50 条
  • [21] Embedded Cardinality Constraints
    Wei, Ziheng
    Link, Sebastian
    ADVANCED INFORMATION SYSTEMS ENGINEERING, CAISE 2018, 2018, 10816 : 523 - 538
  • [22] Probabilistic Cardinality Constraints
    Roblot, Tania
    Link, Sebastian
    CONCEPTUAL MODELING, ER 2015, 2015, 9381 : 214 - 228
  • [23] Balanced edge colorings
    Balister, PN
    Kostochka, A
    Li, H
    Schelp, RH
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2004, 90 (01) : 3 - 20
  • [24] EDGE HOMOGENEOUS COLORINGS
    Madaras, Tomas
    Onderko, Alfred
    Schweser, Thomas
    OPUSCULA MATHEMATICA, 2022, 42 (01) : 65 - 73
  • [25] Point-set embedding of trees with edge constraints
    Di Giacomo, Emilio
    Didimo, Walter
    Liotta, Giuseppe
    Meijer, Henk
    Wismath, Stephen
    GRAPH DRAWING, 2008, 4875 : 113 - +
  • [26] Trees in greedy colorings of hypergraphs
    Gyarfas, Andras
    Lehel, Jeno
    DISCRETE MATHEMATICS, 2011, 311 (2-3) : 208 - 209
  • [27] Hyperbolic Tessellation and Colorings of Trees
    Kim, Dong Han
    Lim, Seonhee
    ABSTRACT AND APPLIED ANALYSIS, 2013,
  • [28] Acyclic colorings of products of trees
    Jamison, Robert E.
    Matthews, Gretchen L.
    Villalpando, John
    INFORMATION PROCESSING LETTERS, 2006, 99 (01) : 7 - 12
  • [29] RECOGNIZABLE COLORINGS OF CYCLES AND TREES
    Dorfling, Michael J.
    Dorfling, Samantha
    DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2012, 32 (01) : 81 - 90
  • [30] Cost total colorings of trees
    Isobe, S
    Zhou, X
    Nishizeki, T
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2004, E87D (02) : 337 - 342
12345