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

来源：

JOURNAL OF ALGORITHMS | 1997年 / 23卷 / 02期

关键词：

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 条

[21] Total coloring of series-parallel graphs
Wu, JL
Hu, DQ
ARS COMBINATORIA, 2004, 73 : 215 - 217
[22] The Entire Coloring of Series-Parallel Graphs
Jian-liang Wu~1
Acta Mathematicae Applicatae Sinica(English Series), 2005, (01) : 61 - 66
[23] Edge-Coloring Algorithms for Bounded Degree Multigraphs
Dhawan, Abhishek
PROCEEDINGS OF THE 2024 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2024, : 2120 - 2157
[24] TRANSFORMATIONS OF EDGE-COLORING OF BIPARTITE MULTIGRAPHS AND THEIR APPLICATIONS
ASRATYAN, AS
MIRUMYAN, AN
DOKLADY AKADEMII NAUK SSSR, 1991, 316 (01): : 11 - 13
[25] FAST PARALLEL ALGORITHMS FOR THE APPROXIMATE EDGE-COLORING PROBLEM
LIANG, WF
INFORMATION PROCESSING LETTERS, 1995, 55 (06) : 333 - 338
[26] Edge-coloring bipartite multigraphs in O(ElogD) time
Cole, R
Ost, K
Schirra, S
COMBINATORICA, 2001, 21 (01) : 5 - 12
[27] Edge-coloring of plane multigraphs with many colors on facial cycles
Czap, Julius
Jendrol, Stanislav
Valiska, Juraj
DISCRETE APPLIED MATHEMATICS, 2020, 282 : 80 - 85
[28] Fractional, Circular, and Defective Coloring of Series-Parallel Graphs
Goddard, Wayne
Xu, Honghai
JOURNAL OF GRAPH THEORY, 2016, 81 (02) : 146 - 153
[29] Edge-Coloring Bipartite Multigraphs in O(E logD) Time
Richard Cole
Kirstin Ost
Stefan Schirra
Combinatorica, 2001, 21 : 5 - 12
[30] Mixed hypergraphs with bounded degree:: edge-coloring of mixed multigraphs
Král, D
Kratochvíl, J
Voss, HJ
THEORETICAL COMPUTER SCIENCE, 2003, 295 (1-3) : 263 - 278

← 1 2 3 4 5 →