{"title":"Long Paths in Random Apollonian Networks","authors":"C. Cooper, A. Frieze","doi":"10.1080/15427951.2014.925524","DOIUrl":null,"url":null,"abstract":"We consider the length L(n) of the longest path in a randomly generated Apollonian Network (ApN) . We show that with high probability for any constant c < 2/3.","PeriodicalId":38105,"journal":{"name":"Internet Mathematics","volume":"11 1","pages":"308 - 318"},"PeriodicalIF":0.0000,"publicationDate":"2014-02-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1080/15427951.2014.925524","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Internet Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/15427951.2014.925524","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Mathematics","Score":null,"Total":0}
引用次数: 4
Abstract
We consider the length L(n) of the longest path in a randomly generated Apollonian Network (ApN) . We show that with high probability for any constant c < 2/3.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
