首页> 外文OA文献 >Randomly coloring sparse random graphs with fewer colors than the maximum degree

【2h】

Randomly coloring sparse random graphs with fewer colors than the maximum degree

机译：随机着色稀疏随机图，其颜色少于最大程度

页面导航

著录项
相似文献
相关主题

著录项

作者
Martin Dyer; Abraham D. Flaxman; Alan M. Frieze; Eric Vigoda;
展开▼
作者单位

展开▼
年度 2005
总页数
原文格式 PDF
正文语种
中图分类

相似文献

外文文献
中文文献
专利

1. Randomly coloring sparse random graphs with fewer colors than the maximum degree [J] . Dyer M, Flaxman AD, Frieze AM, Random structures & algorithms . 2006 ,第4期

机译：随机着色稀疏随机图，其颜色少于最大度数
2. Randomly Coloring Planar Graphs with Fewer Colors Than the Maximum Degree [J] . Hayes Thomas P., Vera Juan C., Vigoda Eric Random structures & algorithms . 2015 ,第4期

机译：随机着色比最大程度少的平面图
3. Randomly coloring graphs with lower bounds on girth and maximum degree [J] . Dyer M., Frieze A. Random structures & algorithms . 2003 ,第2期

机译：对周长和最大度数有下限的图形进行随机着色
4. Randomly coloring planar graphs with fewer colors than the maximum degree [C] . Thomas P. Hayes, Juan C. Vera, Eric Vigoda, Annual ACM symposium on Theory of computing;ACM symposium on Theory of computing . 2007

机译：随机着色平面图，其颜色少于最大度数
5. Colorings, Matchings and Packings in Random and Pseudo-Random Graphs [D] . Bal, Deepak 2013

机译：随机图和伪随机图的着色，匹配和堆积
6. Parameter Tuning Patterns for Random Graph Coloring with Quantum Annealing [O] . Olawale Titiloye, Alan Crispin -1

机译：参数调整模式为随机图着色与量子退火
7. Randomly coloring planar graphs with fewer colors than the maximum degree [O] . Hayes, T.P., Vera Lizcano, J.C., Vigoda, E. 2015

机译：随机给平面图上色，颜色比最大程度少

Randomly coloring sparse random graphs with fewer colors than the maximum degree

著录项

相似文献

相关主题

期刊订阅