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


A distributional study of the path edge-covering numbers for random trees
Authors:Alois Panholzer
Institution:Institut für Diskrete Mathematik und Geometrie, Technische Universität Wien, Wiedner Hauptstrasse 8-10/104, A-1040 Wien, Austria
Abstract:We study for various tree families the distribution of the number of edge-disjoint paths required to cover the edges of a random tree of size n. For all tree families considered we can show a central limit theorem with expectation ∼μn and variance ∼νn with constants μ, ν depending on the specific tree family.
Keywords:Path edge-covering number  Random trees  Limiting distribution
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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