An NC parallel algorithm for edge-coloring series-parallel multigraphs

被引:3
|
作者
Zhou, X [1 ]
Suzuki, H [1 ]
Nishizeki, T [1 ]
机构
[1] TOHOKU UNIV,GRAD SCH INFORMAT SCI,SENDAI,MIYAGI 98077,JAPAN
关键词
D O I
10.1006/jagm.1996.0830
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Many combinatorial problems can be efficiently solved in parallel for series-parallel multigraphs. The edge-coloring problem is one of a few combinatorial problems for which no NC parallel algorithm has been obtained for series-parallel multigraphs. This paper gives an NC parallel algorithm for the problem on series-parallel multigraphs G. It takes O(log n) time with O(Delta n/log n) processors, where n is the number of vertices and Delta is the maximum degree of G. (C) 1997 Academic Press.
引用
收藏
页码:359 / 374
页数:16
相关论文
共 50 条
  • [1] A linear algorithm for edge-coloring series-parallel multigraphs
    Zhou, X
    Suzuki, H
    Nishizeki, T
    JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 1996, 20 (01): : 174 - 201
  • [2] AN EFFICIENT ALGORITHM FOR EDGE-COLORING SERIES-PARALLEL MULTIGRAPHS
    ZHOU, X
    NAKANO, S
    SUZUKI, H
    NISHIZEKI, T
    LECTURE NOTES IN COMPUTER SCIENCE, 1992, 583 : 516 - 529
  • [3] EDGE-COLORING SERIES-PARALLEL GRAPHS
    CASPI, Y
    DEKEL, E
    JOURNAL OF ALGORITHMS, 1995, 18 (02) : 296 - 321
  • [4] The equitable edge-coloring of series-parallel graphs
    Song, Huimin
    Wu, Jianliang
    Liu, Guizhen
    COMPUTATIONAL SCIENCE - ICCS 2007, PT 3, PROCEEDINGS, 2007, 4489 : 457 - +
  • [5] Edge-coloring of multigraphs
    Kochol, M
    Krivonaková, N
    Smejová, S
    DISCRETE MATHEMATICS, 2005, 300 (1-3) : 229 - 234
  • [6] Partitioning series-parallel multigraphs into ν*-excluding edge covers
    Liu Guizhen
    Deng Xiaotie
    Xu Changqing
    SCIENCE IN CHINA SERIES A-MATHEMATICS, 2006, 49 (08): : 1082 - 1093
  • [7] Partitioning series-parallel multigraphs into ν*-excluding edge covers
    Guizhen Liu
    Xiaotie Deng
    Changqing Xu
    Science in China Series A: Mathematics, 2006, 49 : 1082 - 1093
  • [8] Partitioning series-parallel multigraphs intoν*-excluding edge covers
    LIU Guizhen
    Department of Computer Science
    Department of Applied Mathematics
    ScienceinChina(SeriesA:Mathematics), 2006, (08) : 1082 - 1093
  • [9] A simple algorithm for edge-coloring bipartite multigraphs
    Alon, N
    INFORMATION PROCESSING LETTERS, 2003, 85 (06) : 301 - 302
  • [10] Parallel algorithms for the edge-coloring and edge-coloring update problems
    Liang, WF
    Shen, XJ
    Hu, Q
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1996, 32 (01) : 66 - 73