具有边间加权和动态边间加权的多层网络中最短路径长度计算的数学框架：以中国北京公交网络为例

{"title":"具有边间加权和动态边间加权的多层网络中最短路径长度计算的数学框架：以中国北京公交网络为例","authors":"Jinling Yang, Zhiwei Chen, R. Criado, Shenggui Zhang","doi":"10.1016/j.chaos.2024.114825","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":517144,"journal":{"name":"Chaos, Solitons & Fractals","volume":"2 3","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A mathematical framework for shortest path length computation in multi-layer networks with inter-edge weighting and dynamic inter-edge weighting: The case of the Beijing bus network, China\",\"authors\":\"Jinling Yang, Zhiwei Chen, R. Criado, Shenggui Zhang\",\"doi\":\"10.1016/j.chaos.2024.114825\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":517144,\"journal\":{\"name\":\"Chaos, Solitons & Fractals\",\"volume\":\"2 3\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Chaos, Solitons & Fractals\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1016/j.chaos.2024.114825\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Chaos, Solitons & Fractals","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1016/j.chaos.2024.114825","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}