A FAST PARALLEL COLORING OF PLANAR GRAPHS WITH 5 COLORS

被引:10
|
作者
NAOR, J
机构
关键词
D O I
10.1016/0020-0190(87)90092-5
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:51 / 53
页数:3
相关论文
共 50 条
  • [1] A LINEAR ALGORITHM FOR COLORING PLANAR GRAPHS WITH 5 COLORS
    WILLIAMS, MH
    COMPUTER JOURNAL, 1985, 28 (01): : 78 - 81
  • [2] OPTIMAL PARALLEL 5-COLORING OF PLANAR GRAPHS
    HAGERUP, T
    CHROBAK, M
    DIKS, K
    SIAM JOURNAL ON COMPUTING, 1989, 18 (02) : 288 - 300
  • [4] COLORING PLANAR GRAPHS IN PARALLEL
    BOYAR, JF
    KARLOFF, HJ
    JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 1987, 8 (04): : 470 - 479
  • [5] Acyclic edge coloring of planar graphs with Δ colors
    Hudak, David
    Kardos, Frantisek
    Luzar, Borut
    Sotak, Roman
    Skrekovski, Riste
    DISCRETE APPLIED MATHEMATICS, 2012, 160 (09) : 1356 - 1368
  • [6] COLORING PERFECT PLANAR GRAPHS IN PARALLEL
    STEWART, IA
    LECTURE NOTES IN COMPUTER SCIENCE, 1989, 344 : 268 - 275
  • [7] FAST PARALLEL ALGORITHMS FOR COLORING RANDOM GRAPHS
    KEDEM, ZM
    PALEM, KV
    PANTZIOU, GE
    SPIRAKIS, PG
    ZAROLIAGIS, CD
    LECTURE NOTES IN COMPUTER SCIENCE, 1992, 570 : 135 - 147
  • [8] Randomly Coloring Planar Graphs with Fewer Colors than the Maximum Degree
    Hayes, Thomas R.
    Vera, Juan C.
    Vigoda, Eric
    STOC 07: PROCEEDINGS OF THE 39TH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING, 2007, : 450 - 458
  • [9] Randomly Coloring Planar Graphs with Fewer Colors Than the Maximum Degree
    Hayes, Thomas P.
    Vera, Juan C.
    Vigoda, Eric
    RANDOM STRUCTURES & ALGORITHMS, 2015, 47 (04) : 731 - 759
  • [10] Three Colors Suffice: Conflict-Free Coloring of Planar Graphs
    Abel, Zachary
    Alvarez, Victor
    Demaine, Erik D.
    Fekete, Sandor P.
    Gour, Aman
    Hesterberg, Adam
    Keldenich, Phillip
    Scheffer, Christian
    PROCEEDINGS OF THE TWENTY-EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2017, : 1951 - 1963