一种计算截线超图的增量算法

IF 0.3 Q4 MATHEMATICS Annales Mathematicae et Informaticae Pub Date : 2023-01-01 DOI:10.33039/ami.2023.08.007

L. Szathmary

{"title":"一种计算截线超图的增量算法","authors":"L. Szathmary","doi":"10.33039/ami.2023.08.007","DOIUrl":null,"url":null,"abstract":". In this paper we present an incremental algorithm for computing the transversal hypergraph. Our algorithm is an optimized version of Berge’s algorithm [2] for solving the transversal hypergraph problem. The original algorithm of Berge is the simplest and most direct scheme for generating all minimal transversals of a hypergraph. Here we present an optimized version of Berge’s algorithm that we call BergeOpt . We show that BergeOpt can significantly reduce the number of expensive inclusion tests","PeriodicalId":43454,"journal":{"name":"Annales Mathematicae et Informaticae","volume":"29 1","pages":""},"PeriodicalIF":0.3000,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An incremental algorithm for computing the transversal hypergraph\",\"authors\":\"L. Szathmary\",\"doi\":\"10.33039/ami.2023.08.007\",\"DOIUrl\":null,\"url\":null,\"abstract\":\". In this paper we present an incremental algorithm for computing the transversal hypergraph. Our algorithm is an optimized version of Berge’s algorithm [2] for solving the transversal hypergraph problem. The original algorithm of Berge is the simplest and most direct scheme for generating all minimal transversals of a hypergraph. Here we present an optimized version of Berge’s algorithm that we call BergeOpt . We show that BergeOpt can significantly reduce the number of expensive inclusion tests\",\"PeriodicalId\":43454,\"journal\":{\"name\":\"Annales Mathematicae et Informaticae\",\"volume\":\"29 1\",\"pages\":\"\"},\"PeriodicalIF\":0.3000,\"publicationDate\":\"2023-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Annales Mathematicae et Informaticae\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.33039/ami.2023.08.007\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Annales Mathematicae et Informaticae","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.33039/ami.2023.08.007","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS","Score":null,"Total":0}

引用次数: 0

摘要

。本文提出了一种计算截线超图的增量算法。我们的算法是Berge算法[2]的优化版本，用于解决横向超图问题。Berge的原始算法是生成超图所有最小截线的最简单、最直接的方案。这里我们提出了Berge算法的优化版本，我们称之为BergeOpt。我们表明，BergeOpt可以显著减少昂贵的包含测试的数量

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

查看原文

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

本刊更多论文

An incremental algorithm for computing the transversal hypergraph

. In this paper we present an incremental algorithm for computing the transversal hypergraph. Our algorithm is an optimized version of Berge’s algorithm [2] for solving the transversal hypergraph problem. The original algorithm of Berge is the simplest and most direct scheme for generating all minimal transversals of a hypergraph. Here we present an optimized version of Berge’s algorithm that we call BergeOpt . We show that BergeOpt can significantly reduce the number of expensive inclusion tests

求助全文

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

来源期刊

Annales Mathematicae et Informaticae MATHEMATICS-

CiteScore

0.90

自引率

0.00%

发文量