随机算法 (Fall 2011)/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.

11 December 2011

27 August 2011

10 August 2011

  • curprev 13:5713:57, 10 August 2011‎ imported>WikiSysop‎ m 2,874 bytes 0‎ Protected "随机算法 (Fall 2011)/Graph Coloring" ([edit=sysop] (indefinite) [move=sysop] (indefinite))
  • curprev 13:4213:42, 10 August 2011‎ imported>WikiSysop‎ 2,874 bytes +2,874‎ Created page with '=Graph Colorings= A '''proper coloring''' of a graph <math>G(V,E)</math> is a mapping <math>f:V\rightarrow[q]</math> for some integer <math>q</math>, satisfying that <math>f(u)\n…'
Retrieved from "https://tcs.nju.edu.cn/wiki/index.php?title=随机算法_(Fall_2011)/Graph_Coloring"