具有可变优先级的优先级队列和用于在一般图中寻找最大加权匹配的O(EV log V)算法

23rd Annual Symposium on Foundations of Computer Science (sfcs 1982) Pub Date : 1982-11-03 DOI:10.1137/0215009

Z. Galil, S. Micali, H. Gabow

{"title":"具有可变优先级的优先级队列和用于在一般图中寻找最大加权匹配的O(EV log V)算法","authors":"Z. Galil, S. Micali, H. Gabow","doi":"10.1137/0215009","DOIUrl":null,"url":null,"abstract":"We define two generalized types of a priority queue by allowing some forms of changing the priorities of the elements in the queue. We show that they can be implemented efficiently. Consequently, each operation takes O(log n) time. We use these generalized priority queues to construct an O(EV log V) algorithm for finding a maximal weighted matching in general graphs.","PeriodicalId":127919,"journal":{"name":"23rd Annual Symposium on Foundations of Computer Science (sfcs 1982)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1982-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"162","resultStr":"{\"title\":\"Priority queues with variable priority and an O(EV log V) algorithm for finding a maximal weighted matching in general graphs\",\"authors\":\"Z. Galil, S. Micali, H. Gabow\",\"doi\":\"10.1137/0215009\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We define two generalized types of a priority queue by allowing some forms of changing the priorities of the elements in the queue. We show that they can be implemented efficiently. Consequently, each operation takes O(log n) time. We use these generalized priority queues to construct an O(EV log V) algorithm for finding a maximal weighted matching in general graphs.\",\"PeriodicalId\":127919,\"journal\":{\"name\":\"23rd Annual Symposium on Foundations of Computer Science (sfcs 1982)\",\"volume\":\"3 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1982-11-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"162\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"23rd Annual Symposium on Foundations of Computer Science (sfcs 1982)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1137/0215009\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"23rd Annual Symposium on Foundations of Computer Science (sfcs 1982)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1137/0215009","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 162

摘要

通过允许以某种形式更改队列中元素的优先级，定义了两种通用的优先级队列类型。我们证明了它们可以有效地实施。因此，每个操作需要O(log n)时间。我们利用这些广义优先级队列构造了一个O(EV log V)算法，用于在一般图中寻找最大加权匹配。

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

查看原文本刊更多论文

Priority queues with variable priority and an O(EV log V) algorithm for finding a maximal weighted matching in general graphs

We define two generalized types of a priority queue by allowing some forms of changing the priorities of the elements in the queue. We show that they can be implemented efficiently. Consequently, each operation takes O(log n) time. We use these generalized priority queues to construct an O(EV log V) algorithm for finding a maximal weighted matching in general graphs.

求助全文

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

来源期刊

23rd Annual Symposium on Foundations of Computer Science (sfcs 1982)

自引率

0.00%

发文量