Improved Edge-Coloring Algorithms for Planar Graphs
暂无分享,去创建一个
[1] Norishige Chiba,et al. A Linear 5-Coloring Algorithm of Planar Graphs , 1981, J. Algorithms.
[2] Ian James Holyer. The computational complexity of graph theory problems , 1981 .
[3] PippengerNicholas,et al. A fast parallel algorithm for routing in permutation networks , 1981 .
[4] David S. Johnson,et al. Some simplified NP-complete problems , 1974, STOC '74.
[5] C. Shannon. A Theorem on Coloring the Lines of a Network , 1949 .
[6] Joseph Naor,et al. A Fast Parallel Coloring of Planar Graphs with Five Colors , 1987, Inf. Process. Lett..
[7] David S. Johnson,et al. Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..
[8] C. Zheng,et al. ; 0 ; , 1951 .
[9] Robin J. Wilson,et al. Edge-colourings of graphs , 1977 .
[10] M. Howard Williams. A Linear Algorithm for Colouring Planar Graphs with Five Colours , 1985, Comput. J..
[11] Richard Cole,et al. Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms , 1986, STOC '86.
[12] Greg N. Frederickson,et al. On Linear-Time Algorithms for Five-Coloring Planar Graphs , 1984, Inf. Process. Lett..
[13] Takao Nishizeki,et al. A Better than "Best Possible" Algorithm to Edge Color Multigraphs , 1986, J. Algorithms.
[14] Joan Boyar,et al. Coloring Planar Graphs in Parallel , 1987, J. Algorithms.
[15] Andrew V. Goldberg,et al. Parallel symmetry-breaking in sparse graphs , 1987, STOC.
[16] Zvi Galil,et al. NP Completeness of Finding the Chromatic Index of Regular Graphs , 1983, J. Algorithms.
[17] Norishige Chiba,et al. A linear algorithm for five-coloring a planar graph , 1980, Graph Theory and Algorithms.
[18] David B. Shmoys,et al. Efficient Parallel Algorithms for Edge Coloring Problems , 1987, J. Algorithms.
[19] Robert E. Tarjan,et al. Two linear-time algorithms for five-coloring a planar graph , 1980 .
[20] Harold N. Gabow,et al. Algorithms for Edge Coloring Bipartite Graphs and Multigraphs , 1982, SIAM J. Comput..
[21] Ian Holyer,et al. The NP-Completeness of Edge-Coloring , 1981, SIAM J. Comput..
[22] K. Appel,et al. Every Planar Map Is Four Colorable , 2019, Mathematical Solitaires & Games.
[23] Leslie G. Valiant,et al. A fast parallel algorithm for routing in permutation networks , 1981, IEEE Transactions on Computers.
[24] Marek Chrobak,et al. Fast Algorithms for Edge-Coloring Planar Graphs , 1989, J. Algorithms.
[25] Marek Chrobak,et al. Optimal Parallel 5-Colouring of Planar Graphs , 1989, SIAM J. Comput..
[26] A. Bonato,et al. Graphs and Hypergraphs , 2021, Clustering.
[27] Michael Luby,et al. A simple parallel algorithm for the maximal independent set problem , 1985, STOC '85.