{"title":"具有直径要求的图增广问题","authors":"Toshimasa Ishii","doi":"10.1109/ICNC.2012.75","DOIUrl":null,"url":null,"abstract":"In communication networks, the distance between two nodes is one measure of transfer delay between them. Thus, it is required that the diameter of the network, which is defined as the maximum distance between every two nodes in it, is relatively small. This paper surveys the computational results on graph augmentation problems which model network design problems with diameter requirements, initiated in [F. R. K. Chung and M. R. Garey, \"Diameter bounds for altered graphs,\" J. Graph Theory, vol. 8, pp. 511-534, 1984].","PeriodicalId":442973,"journal":{"name":"2012 Third International Conference on Networking and Computing","volume":"796 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Graph Augmentation Problem with Diameter Requirements\",\"authors\":\"Toshimasa Ishii\",\"doi\":\"10.1109/ICNC.2012.75\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In communication networks, the distance between two nodes is one measure of transfer delay between them. Thus, it is required that the diameter of the network, which is defined as the maximum distance between every two nodes in it, is relatively small. This paper surveys the computational results on graph augmentation problems which model network design problems with diameter requirements, initiated in [F. R. K. Chung and M. R. Garey, \\\"Diameter bounds for altered graphs,\\\" J. Graph Theory, vol. 8, pp. 511-534, 1984].\",\"PeriodicalId\":442973,\"journal\":{\"name\":\"2012 Third International Conference on Networking and Computing\",\"volume\":\"796 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-12-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 Third International Conference on Networking and Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICNC.2012.75\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 Third International Conference on Networking and Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICNC.2012.75","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Graph Augmentation Problem with Diameter Requirements
In communication networks, the distance between two nodes is one measure of transfer delay between them. Thus, it is required that the diameter of the network, which is defined as the maximum distance between every two nodes in it, is relatively small. This paper surveys the computational results on graph augmentation problems which model network design problems with diameter requirements, initiated in [F. R. K. Chung and M. R. Garey, "Diameter bounds for altered graphs," J. Graph Theory, vol. 8, pp. 511-534, 1984].
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
