arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1107.4301math.CO
收藏

生成拟阵平坦面的输出敏感算法

Output-sensitive algorithm for generating the flats of a matroid

A. Montina

摘要:

我们提出了一个输出敏感的算法,用于生成一个有限拟阵的整个平面集。给定一个过程P,在S_P时间步内判断一个集合是否独立,算法的时间复杂度为O(N^2 M S_P),其中N和M分别是输入和输出大小。在向量拟阵的情况下,报告了一个特定的算法,其时间复杂度等于O(N^2 M d^2),d是拟阵的秩。在某些情况下,该算法可以提供一个有效的方法来计算zonotopes在$H$ -表示,给出他们的表示在闵可夫斯基和已知的部分。

英文摘要:

We present an output-sensitive algorithm for generating the whole set of flats of a finite matroid. Given a procedure, P, that decides in S_P time steps if a set is independent, the time complexity of the algorithm is O(N^2 M S_P), where N and M are the input and output size, respectively. In the case of vectorial matroids, a specific algorithm is reported whose time complexity is equal to O(N^2 M d^2), d being the rank of the matroid. In some cases this algorithm can provide an efficient method for computing zonotopes in $H$-representation, given their representation in terms of Minkowski sum of known segments.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑