实现健壮点对点网络范例的图论方法

2008 33rd IEEE Conference on Local Computer Networks (LCN) Pub Date : 2008-10-31 DOI:10.1109/LCN.2008.4664227

Hosein Shafiei, F. Hoseini, A. Khonsari, M. Ould-Khaoua

{"title":"实现健壮点对点网络范例的图论方法","authors":"Hosein Shafiei, F. Hoseini, A. Khonsari, M. Ould-Khaoua","doi":"10.1109/LCN.2008.4664227","DOIUrl":null,"url":null,"abstract":"In this paper, we proposed a graph theoretic approach employing an algorithmic method to construct constant-degree graphs possessing not only provably minimum diameter, but also maximum connectivity with respect to other similar graphs.","PeriodicalId":218005,"journal":{"name":"2008 33rd IEEE Conference on Local Computer Networks (LCN)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A graph theoretic approach in achieving robust peer-to-peer networking paradigm\",\"authors\":\"Hosein Shafiei, F. Hoseini, A. Khonsari, M. Ould-Khaoua\",\"doi\":\"10.1109/LCN.2008.4664227\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we proposed a graph theoretic approach employing an algorithmic method to construct constant-degree graphs possessing not only provably minimum diameter, but also maximum connectivity with respect to other similar graphs.\",\"PeriodicalId\":218005,\"journal\":{\"name\":\"2008 33rd IEEE Conference on Local Computer Networks (LCN)\",\"volume\":\"3 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-10-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 33rd IEEE Conference on Local Computer Networks (LCN)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/LCN.2008.4664227\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 33rd IEEE Conference on Local Computer Networks (LCN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LCN.2008.4664227","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

在本文中，我们提出了一种图论方法，利用一种算法方法来构造具有可证明的最小直径且相对于其他类似图具有最大连通性的等度图。

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

查看原文本刊更多论文

A graph theoretic approach in achieving robust peer-to-peer networking paradigm

In this paper, we proposed a graph theoretic approach employing an algorithmic method to construct constant-degree graphs possessing not only provably minimum diameter, but also maximum connectivity with respect to other similar graphs.

求助全文

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

来源期刊

2008 33rd IEEE Conference on Local Computer Networks (LCN)

自引率

0.00%

发文量