平面图中最短路径的线性处理器多对数时间算法

Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science Pub Date : 1993-11-03 DOI:10.1109/SFCS.1993.366861

P. Klein, Sairam Subramanian

{"title":"平面图中最短路径的线性处理器多对数时间算法","authors":"P. Klein, Sairam Subramanian","doi":"10.1109/SFCS.1993.366861","DOIUrl":null,"url":null,"abstract":"We give an algorithm requiring polylog time and a linear number of processors to solve single-source shortest paths in directed planar graphs, bounded-genus graphs, and 2-dimensional overlap graphs. More generally, the algorithm works for any graph provided with a decomposition tree constructed using size-O(/spl radic/n polylog n) separators.<<ETX>>","PeriodicalId":253303,"journal":{"name":"Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science","volume":"54 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"53","resultStr":"{\"title\":\"A linear-processor polylog-time algorithm for shortest paths in planar graphs\",\"authors\":\"P. Klein, Sairam Subramanian\",\"doi\":\"10.1109/SFCS.1993.366861\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We give an algorithm requiring polylog time and a linear number of processors to solve single-source shortest paths in directed planar graphs, bounded-genus graphs, and 2-dimensional overlap graphs. More generally, the algorithm works for any graph provided with a decomposition tree constructed using size-O(/spl radic/n polylog n) separators.<<ETX>>\",\"PeriodicalId\":253303,\"journal\":{\"name\":\"Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science\",\"volume\":\"54 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1993-11-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"53\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SFCS.1993.366861\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SFCS.1993.366861","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 53

摘要

我们给出了一种算法，该算法需要多对数时间和线性数量的处理器来求解有向平面图、有界属图和二维重叠图中的单源最短路径。更一般地说，该算法适用于任何具有使用size-O(/spl radial /n polylogn)分隔符构建的分解树的图。

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

查看原文本刊更多论文

A linear-processor polylog-time algorithm for shortest paths in planar graphs

We give an algorithm requiring polylog time and a linear number of processors to solve single-source shortest paths in directed planar graphs, bounded-genus graphs, and 2-dimensional overlap graphs. More generally, the algorithm works for any graph provided with a decomposition tree constructed using size-O(/spl radic/n polylog n) separators.<>

求助全文

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

来源期刊

Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science

自引率

0.00%

发文量