三连通性增强的线性时间算法

[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science Pub Date : 1991-09-01 DOI:10.1109/SFCS.1991.185418

T. Hsu, V. Ramachandran

{"title":"三连通性增强的线性时间算法","authors":"T. Hsu, V. Ramachandran","doi":"10.1109/SFCS.1991.185418","DOIUrl":null,"url":null,"abstract":"The problem of finding the smallest set of edges whose addition triconnects an undirected graph is considered. This is a fundamental graph-theoretic problem that has applications in designing reliable networks and fault-tolerant computing. A linear time sequential algorithm is given for the problem. This is a substantial improvement over the best previous algorithm for this problem, which runs in O(n(n+m)/sup 2/) time on a graph with n vertices and m edges.<<ETX>>","PeriodicalId":320781,"journal":{"name":"[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1991-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"68","resultStr":"{\"title\":\"A linear time algorithm for triconnectivity augmentation\",\"authors\":\"T. Hsu, V. Ramachandran\",\"doi\":\"10.1109/SFCS.1991.185418\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The problem of finding the smallest set of edges whose addition triconnects an undirected graph is considered. This is a fundamental graph-theoretic problem that has applications in designing reliable networks and fault-tolerant computing. A linear time sequential algorithm is given for the problem. This is a substantial improvement over the best previous algorithm for this problem, which runs in O(n(n+m)/sup 2/) time on a graph with n vertices and m edges.<<ETX>>\",\"PeriodicalId\":320781,\"journal\":{\"name\":\"[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science\",\"volume\":\"19 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1991-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"68\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SFCS.1991.185418\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SFCS.1991.185418","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 68

摘要

研究了求无向图三连通的最小边集的问题。这是一个基本的图论问题，在设计可靠网络和容错计算方面具有应用。给出了求解该问题的线性时序算法。这是对该问题的最佳先前算法的实质性改进，该算法在具有n个顶点和m条边的图上运行时间为O(n(n+m)/sup 2/)。

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

查看原文本刊更多论文

A linear time algorithm for triconnectivity augmentation

The problem of finding the smallest set of edges whose addition triconnects an undirected graph is considered. This is a fundamental graph-theoretic problem that has applications in designing reliable networks and fault-tolerant computing. A linear time sequential algorithm is given for the problem. This is a substantial improvement over the best previous algorithm for this problem, which runs in O(n(n+m)/sup 2/) time on a graph with n vertices and m edges.<>

求助全文

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

来源期刊

[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science

自引率

0.00%

发文量