首页 | 本学科首页   官方微博 | 高级检索  
     


Colouring random graphs
Authors:Colin McDiarmid
Affiliation:(1) Institute of Economics and Statistics, University of Oxford, St. Cross Building Manor Road, OX1 3UL Oxford, England
Abstract:We discuss some results concerned with the behaviour of colouring algorithms on large random graphs.
Keywords:Random graphs  colouring  probabilistic analysis of algorithms  greedy heuristics
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号