Petford and Welsh (3-Graph Coloring Graph Coloring): Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

10 April 2023

15 February 2023

  • curprev 11:3511:35, 15 February 2023‎ Admin talk contribs‎ 462 bytes +462‎ Created page with "== Time Complexity == $O(nlogn)$ == Space Complexity == $O(n)$ words (Derived: we store the coloring of each vertex in a dictionary and the maximum size of this dictionary is equal to the number of vertices in the graph, n.) == Description == == Approximate? == Exact == Randomized? == Yes, Monte Carlo == Model of Computation == Word RAM == Year == 1989 == Reference == https://www.sciencedirect.com/science/article/pii/0012365X89902148"
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Petford_and_Welsh_(3-Graph_Coloring_Graph_Coloring)"