更改

添加180字节 、 2020年9月6日 (日) 18:05
第207行: 第207行:     
== Coloring ==
 
== Coloring ==
 +
着色<br>
    
Given a random graph ''G'' of order ''n'' with the vertex ''V''(''G'') = {1, ..., ''n''}, by the [[greedy algorithm]] on the number of colors, the vertices can be colored with colors 1, 2, ... (vertex 1 is colored 1, vertex 2 is colored 1 if it is not adjacent to vertex 1, otherwise it is colored 2, etc.).<ref name = "Random Graphs2" />
 
Given a random graph ''G'' of order ''n'' with the vertex ''V''(''G'') = {1, ..., ''n''}, by the [[greedy algorithm]] on the number of colors, the vertices can be colored with colors 1, 2, ... (vertex 1 is colored 1, vertex 2 is colored 1 if it is not adjacent to vertex 1, otherwise it is colored 2, etc.).<ref name = "Random Graphs2" />
第212行: 第213行:  
Given a random graph G of order n with the vertex V(G) = {1, ..., n}, by the greedy algorithm on the number of colors, the vertices can be colored with colors 1, 2, ... (vertex 1 is colored 1, vertex 2 is colored 1 if it is not adjacent to vertex 1, otherwise it is colored 2, etc.).
 
Given a random graph G of order n with the vertex V(G) = {1, ..., n}, by the greedy algorithm on the number of colors, the vertices can be colored with colors 1, 2, ... (vertex 1 is colored 1, vertex 2 is colored 1 if it is not adjacent to vertex 1, otherwise it is colored 2, etc.).
   −
给定一个 n 阶随机图 g,其顶点 v (g) = {1,... ,n } ,通过关于颜色数的贪婪算法,可以用颜色1,2,... (顶点1是有色的1,顶点2是有色的1,如果它不邻接顶点1,否则它是有色的2,等等。).
+
给定一个 ''n'' 阶随机图 ''G'',其顶点 ''V''(''G'') = {1,... ,''n'' } ,通过关于颜色数的'''<font color="#FF8000">贪婪算法 Greedy Algorithm </font>''',可以用颜色1,2。。。 (如果顶点1与顶点2不相邻,则顶点1与顶点2为染相同的颜色,否则染不同的颜色,以此类推。).
    
The number of proper colorings of random graphs given a number of ''q'' colors, called its [[chromatic polynomial]], remains unknown so far. The scaling of zeros of the chromatic polynomial of random graphs with parameters ''n'' and the number of edges ''m'' or the connection probability ''p'' has been studied empirically using an algorithm based on symbolic pattern matching.<ref name = "Chromatic Polynomials of Random Graphs">{{cite journal | last1 = Van Bussel | first1 = Frank | last2 = Ehrlich | first2 = Christoph | last3 = Fliegner | first3 = Denny | last4 = Stolzenberg | first4 = Sebastian | last5 = Timme | first5 = Marc | year = 2010 | title = Chromatic Polynomials of Random Graphs | url = | journal = J. Phys. A: Math. Theor. | volume = 43 | issue = 17| page = 175002 | doi = 10.1088/1751-8113/43/17/175002 | arxiv = 1709.06209 | bibcode = 2010JPhA...43q5002V }}</ref>
 
The number of proper colorings of random graphs given a number of ''q'' colors, called its [[chromatic polynomial]], remains unknown so far. The scaling of zeros of the chromatic polynomial of random graphs with parameters ''n'' and the number of edges ''m'' or the connection probability ''p'' has been studied empirically using an algorithm based on symbolic pattern matching.<ref name = "Chromatic Polynomials of Random Graphs">{{cite journal | last1 = Van Bussel | first1 = Frank | last2 = Ehrlich | first2 = Christoph | last3 = Fliegner | first3 = Denny | last4 = Stolzenberg | first4 = Sebastian | last5 = Timme | first5 = Marc | year = 2010 | title = Chromatic Polynomials of Random Graphs | url = | journal = J. Phys. A: Math. Theor. | volume = 43 | issue = 17| page = 175002 | doi = 10.1088/1751-8113/43/17/175002 | arxiv = 1709.06209 | bibcode = 2010JPhA...43q5002V }}</ref>
第218行: 第219行:  
The number of proper colorings of random graphs given a number of q colors, called its chromatic polynomial, remains unknown so far. The scaling of zeros of the chromatic polynomial of random graphs with parameters n and the number of edges m or the connection probability p has been studied empirically using an algorithm based on symbolic pattern matching.
 
The number of proper colorings of random graphs given a number of q colors, called its chromatic polynomial, remains unknown so far. The scaling of zeros of the chromatic polynomial of random graphs with parameters n and the number of edges m or the connection probability p has been studied empirically using an algorithm based on symbolic pattern matching.
   −
给定一定数量的 q 颜色的随机图的真彩色的数目,称为它的色多项式,到目前为止仍然是未知的。本文采用基于符号模式匹配的算法,对参数 n 和边数 m 或连接概率 p 的随机图的零点标度问题进行了实证研究。
+
给定一个 ''q'' 颜色的随机图的真染色数,称为它的色多项式,到目前为止还不清楚。利用'''<font color="#FF8000">符号模式匹配算法 Algorithm Based On Symbolic Pattern Matching </font>''' ,对参数为 ''n'' 、边数为 ''m'' 或连接概率为 ''p'' 的随机图的色多项式零点的标度进行了实验研究。。
 
  −
 
      
== Random trees ==
 
== Random trees ==
274

个编辑