An algorithm for determining the chromatic number of a graph

Simple item page
dc.contributor.authorMiller, D., M.
dc.date.accessioned2023-03-01T18:30:05Z
dc.date.available2023-03-01T18:30:05Z
dc.date.issued1975
dc.description.abstractAn algorithm for determining the chromatic number of a graph is presented. The storage requirement is on the order of the square of the number of vertices in the graph. Preliminary empirical tests indicate this algorithm is faster than previous algorithms.
dc.description.copyrightCopyright @ D. Michael Miller, 1975.
dc.identifier.urihttps://unbscholar.lib.unb.ca/handle/1882/14971
dc.rightshttp://purl.org/coar/access_right/c_abf2
dc.subject.disciplineComputer Science
dc.titleAn algorithm for determining the chromatic number of a graph
dc.typetechnical report

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
item.pdf
Size:
229.87 KB
Format:
Adobe Portable Document Format
Download

Collections

Research Reports