网络中最短路径树动态维护算法的实验评价

Interdisciplinary information sciences Pub Date : 2015-03-01 DOI:10.4036/IIS.2015.25

Takashi Hasegawa, Takehiro Ito, Akira Suzuki, Xiao Zhou

{"title":"网络中最短路径树动态维护算法的实验评价","authors":"Takashi Hasegawa, Takehiro Ito, Akira Suzuki, Xiao Zhou","doi":"10.4036/IIS.2015.25","DOIUrl":null,"url":null,"abstract":"For a digraph G 1⁄4 ðV ;AÞ and a source vertex s 2 V , suppose that we wish to compute a shortest directed path from s to every vertex v 2 V n fsg (if exists) under several arc costs. Frigioni et al. (2000) proposed a dynamic algorithm which efficiently reuses the shortest-paths information computed for the previous arc costs. In this paper, we experimentally evaluate how such a dynamic algorithm works efficiently for real-world networks.","PeriodicalId":91087,"journal":{"name":"Interdisciplinary information sciences","volume":"21 1","pages":"25-35"},"PeriodicalIF":0.0000,"publicationDate":"2015-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Experimental Evaluations of Dynamic Algorithm for Maintaining Shortest-Paths Trees on Real-World Networks\",\"authors\":\"Takashi Hasegawa, Takehiro Ito, Akira Suzuki, Xiao Zhou\",\"doi\":\"10.4036/IIS.2015.25\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"For a digraph G 1⁄4 ðV ;AÞ and a source vertex s 2 V , suppose that we wish to compute a shortest directed path from s to every vertex v 2 V n fsg (if exists) under several arc costs. Frigioni et al. (2000) proposed a dynamic algorithm which efficiently reuses the shortest-paths information computed for the previous arc costs. In this paper, we experimentally evaluate how such a dynamic algorithm works efficiently for real-world networks.\",\"PeriodicalId\":91087,\"journal\":{\"name\":\"Interdisciplinary information sciences\",\"volume\":\"21 1\",\"pages\":\"25-35\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-03-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Interdisciplinary information sciences\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4036/IIS.2015.25\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Interdisciplinary information sciences","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4036/IIS.2015.25","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

对于一个有向图g1 / 4½V;AÞ和一个源顶点s2v，假设我们希望在几个弧代价下计算从s到每个顶点v2v的最短有向路径n fsg(如果存在)。Frigioni et al.(2000)提出了一种动态算法，该算法有效地重用了之前计算出的最短路径信息。在本文中，我们通过实验评估了这种动态算法如何有效地适用于现实世界的网络。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Experimental Evaluations of Dynamic Algorithm for Maintaining Shortest-Paths Trees on Real-World Networks

For a digraph G 1⁄4 ðV ;AÞ and a source vertex s 2 V , suppose that we wish to compute a shortest directed path from s to every vertex v 2 V n fsg (if exists) under several arc costs. Frigioni et al. (2000) proposed a dynamic algorithm which efficiently reuses the shortest-paths information computed for the previous arc costs. In this paper, we experimentally evaluate how such a dynamic algorithm works efficiently for real-world networks.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Interdisciplinary information sciences

自引率

0.00%

发文量