加权循环图中中心问题的线性时间算法

IF 0.7 4区计算机科学 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS Information Processing Letters Pub Date : 2024-04-04 DOI:10.1016/j.ipl.2024.106495

Taekang Eom , Hee-Kap Ahn

{"title":"加权循环图中中心问题的线性时间算法","authors":"Taekang Eom , Hee-Kap Ahn","doi":"10.1016/j.ipl.2024.106495","DOIUrl":null,"url":null,"abstract":"<div><p>We study the problem of computing the center of cycle graphs whose vertices are weighted. The distance from a vertex to a point of the graph is defined as the weight of the vertex times the length of the shortest path between the vertex and the point. The weighted center of the graph is a point of the graph such that the maximum distance of the vertices of the graph to the point is minimum among all points of the graph. We present an <span><math><mi>O</mi><mo>(</mo><mi>n</mi><mo>)</mo></math></span>-time algorithm for the discrete and continuous weighted center problem on cycle graphs with <em>n</em> vertices. Our algorithm improves upon the best known algorithm that takes <span><math><mi>O</mi><mo>(</mo><mi>n</mi><mi>log</mi><mo>⁡</mo><mi>n</mi><mo>)</mo></math></span> time. Moreover, it is optimal for the weighted center problem of cycle graphs.</p></div>","PeriodicalId":56290,"journal":{"name":"Information Processing Letters","volume":"186 ","pages":"Article 106495"},"PeriodicalIF":0.7000,"publicationDate":"2024-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A linear-time algorithm for the center problem in weighted cycle graphs\",\"authors\":\"Taekang Eom , Hee-Kap Ahn\",\"doi\":\"10.1016/j.ipl.2024.106495\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>We study the problem of computing the center of cycle graphs whose vertices are weighted. The distance from a vertex to a point of the graph is defined as the weight of the vertex times the length of the shortest path between the vertex and the point. The weighted center of the graph is a point of the graph such that the maximum distance of the vertices of the graph to the point is minimum among all points of the graph. We present an <span><math><mi>O</mi><mo>(</mo><mi>n</mi><mo>)</mo></math></span>-time algorithm for the discrete and continuous weighted center problem on cycle graphs with <em>n</em> vertices. Our algorithm improves upon the best known algorithm that takes <span><math><mi>O</mi><mo>(</mo><mi>n</mi><mi>log</mi><mo>⁡</mo><mi>n</mi><mo>)</mo></math></span> time. Moreover, it is optimal for the weighted center problem of cycle graphs.</p></div>\",\"PeriodicalId\":56290,\"journal\":{\"name\":\"Information Processing Letters\",\"volume\":\"186 \",\"pages\":\"Article 106495\"},\"PeriodicalIF\":0.7000,\"publicationDate\":\"2024-04-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Information Processing Letters\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0020019024000255\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information Processing Letters","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0020019024000255","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}

引用次数: 0

摘要

我们研究的是计算顶点加权的循环图中心的问题。从顶点到图中某一点的距离定义为顶点的权重乘以顶点与该点间最短路径的长度。图的加权中心是图中的一个点，在图的所有点中，图顶点到该点的最大距离最小。我们针对有 n 个顶点的循环图上的离散和连续加权中心问题提出了一种 O(n)-time 算法。我们的算法改进了需要 O(nlogn) 时间的已知最佳算法。此外，它还是循环图加权中心问题的最佳算法。

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

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

A linear-time algorithm for the center problem in weighted cycle graphs

We study the problem of computing the center of cycle graphs whose vertices are weighted. The distance from a vertex to a point of the graph is defined as the weight of the vertex times the length of the shortest path between the vertex and the point. The weighted center of the graph is a point of the graph such that the maximum distance of the vertices of the graph to the point is minimum among all points of the graph. We present an $O (n)$ -time algorithm for the discrete and continuous weighted center problem on cycle graphs with n vertices. Our algorithm improves upon the best known algorithm that takes $O (n \log n)$ time. Moreover, it is optimal for the weighted center problem of cycle graphs.

求助全文

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

来源期刊

Information Processing Letters 工程技术-计算机：信息系统

CiteScore

1.80

自引率

0.00%

发文量

审稿时长

7.3 months

期刊介绍： Information Processing Letters invites submission of original research articles that focus on fundamental aspects of information processing and computing. This naturally includes work in the broadly understood field of theoretical computer science; although papers in all areas of scientific inquiry will be given consideration, provided that they describe research contributions credibly motivated by applications to computing and involve rigorous methodology. High quality experimental papers that address topics of sufficiently broad interest may also be considered. Since its inception in 1971, Information Processing Letters has served as a forum for timely dissemination of short, concise and focused research contributions. Continuing with this tradition, and to expedite the reviewing process, manuscripts are generally limited in length to nine pages when they appear in print.

期刊最新文献

On the Tractability Landscape of the Conditional Minisum Approval Voting Rule Total variation distance for product distributions is #P-complete A lower bound for the Quickhull convex hull algorithm that disproves the Quickhull precision conjecture String searching with mismatches using AVX2 and AVX-512 instructions On approximate reconfigurability of label cover