An effcient algorithm for the nearly equitable edge coloring problem

被引：1
|
作者：
Graduate School of Information Science, Nagoya University, Nagoya 464-8603, Japan [1 ]
不详 [2 ]
机构：
来源：
J. Graph Algorithms and Appl. | 2008年 / 4卷 / 383-399期
关键词：
Directed graphs;
D O I：
10.7155/jgaa.00171
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [41] Approximation algorithm for maximum edge coloring
    Feng, Wangsen
    Zhang, Li'ang
    Wang, Hanpin
    THEORETICAL COMPUTER SCIENCE, 2009, 410 (11) : 1022 - 1029
  • [42] Equitable Edge Coloring of Splitting Graph of Some Classes of Wheel Graphs
    Jagannathan, M.
    Vivin, Vernold J.
    Vivik, Veninstine J.
    ARS COMBINATORIA, 2020, 151 : 211 - 220
  • [43] An approximation algorithm dependent on edge-coloring number for minimum maximal matching problem
    Matsumoto, Yusuke
    Kamiyama, Naoyuki
    Imai, Keiko
    INFORMATION PROCESSING LETTERS, 2011, 111 (10) : 465 - 468
  • [44] EQUITABLE COLORING OF TREES
    CHEN, BL
    LIH, KW
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 1994, 61 (01) : 83 - 87
  • [45] Equitable coloring of hypergraphs
    Furmanczyk, Hanna
    Obszarski, Pawel
    DISCRETE APPLIED MATHEMATICS, 2019, 261 : 186 - 192
  • [46] Equitable oriented coloring
    Dybizbanski, Janusz
    JOURNAL OF GRAPH THEORY, 2023, 104 (01) : 171 - 187
  • [47] Equitable Δ-coloring of graphs
    Chen, Bor-Liang
    Yen, Chih-Hung
    DISCRETE MATHEMATICS, 2012, 312 (09) : 1512 - 1517
  • [48] On the max-weight edge coloring problem
    Giorgio Lucarelli
    Ioannis Milis
    Vangelis T. Paschos
    Journal of Combinatorial Optimization, 2010, 20 : 429 - 442
  • [49] On the max-weight edge coloring problem
    Lucarelli, Giorgio
    Milis, Ioannis
    Paschos, Vangelis T.
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2010, 20 (04) : 429 - 442
  • [50] Approximating the max-edge-coloring problem
    Bourgeois, N.
    Lucarelli, G.
    Milis, I.
    Paschos, V. Th.
    THEORETICAL COMPUTER SCIENCE, 2010, 411 (34-36) : 3055 - 3067
12345