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


Lattice bandwidth of random graphs
Authors:Colin McDiarmid

Zevi Miller

Institution:

Institute of Economics and Statistics, University of Oxford, Oxford, UK OX1 3UL

Department of Mathematics and Statistics, Miami University, Oxford, OH 45056, USA

Abstract:The bandwidth of a random graph has been well studied. A natural generalization of bandwidth involves replacing the path as host graph by a multi-dimensional lattice. In this paper we investigate the corresponding behavior for random graphs.
Keywords:
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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