IEEE - Institute of Electrical and Electronics Engineers, Inc. - An efficient parallel algorithm for edge-coloring of graphs

Proceedings of TENCON '93. IEEE Region 10 International Conference on Computers, Communications and Automation

Author(s): Tang Ceshan
Publisher: IEEE - Institute of Electrical and Electronics Engineers, Inc.
Publication Date: 1 January 1993
Conference Location: Beijing, China, China
Conference Date: 19 October 1993
Volume: 2
Page Count: 3
ISBN (Paper): 0-7803-1233-3
DOI: 10.1109/TENCON.1993.320178
Regular:

Given G=(V,E) is a simple planar graph, and it doesn't contain any odd loops, |V|=n, |E|=m. We propose an efficient parallel algorithm for edge-coloring by using /spl Delta/ colors, based on... View More

Advertisement