首页/论文/2004.07823

arXiv 2004.078232020-04cs.DMcs.DS

Polynomial-delay Enumeration Algorithms in Set Systems

Kazuya Haraguchi, Hiroshi Nagamochi

备注：: arXiv admin note: substantial text overlap with arXiv:2004.01904

英文摘要：

We consider a set system $(V, {\mathcal C}\subseteq 2^V)$ on a finite set $V$ of elements, where we call a set $C\in {\mathcal C}$ a component. We assume that two oracles $\mathrm{L}_1$ and $\mathrm{L}_2$ are available, where given two subsets $X,Y\subseteq V$, $\mathrm{L}_1$ returns a maximal component $C\in {\mathcal C}$ with $X\subseteq C\subseteq Y$; and given a set $Y\subseteq V$, $\mathrm{L}_2$ returns all maximal components $C\in {\mathcal C}$ with $C\subseteq Y$. Given a set $I$ of attributes and a function $σ:V\to 2^I$ in a transitive system, a component $C\in {\mathcal C}$ is called a solution if the set of common attributes in $C$ is inclusively maximal; i.e., $\bigcap_{v\in C}σ(v)\supsetneq \bigcap_{v\in X}σ(v)$ for any component $X\in{\mathcal C}$ with $C\subsetneq X$. We prove that there exists an algorithm of enumerating all solutions (or all components) in delay bounded by a polynomial with respect to the input size and the running times of the oracles.

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

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

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

继续探索

相关论文

Neighborhood inclusions for minimal dominating sets enumeration: linear and polynomial delay algorithms in $P_7$-free and $P_8$-free chordal graphs

In [M. M. Kanté, V. Limouzy, A. Mary, and L. Nourine. On the enumeration of minimal dominating sets and related notions. SIAM Journal on Discrete Mathematics, 28(4):1916-1929, 2014] the authors give an $O(n+m)$ delay algorithm based on neighborhood inclusions for the enumeration of minimal dominating sets in split and $P_6$-free chordal graphs. In this paper, we investigate generalizations of this technique to $P_k$-free chordal graphs for larger integers $k$. In particular, we give $O(n+m)$ and $O(n^3\cdot m)$ delays algorithms in the classes of $P_7$-free and $P_8$-free chordal graphs. As fo…

2019-09-28cs.DMcs.DSmath.CO

恒定延迟的格位理想和反链的格码枚举

Constant delay Gray code enumeration of ideals and antichains in posets

University of Kassel（卡塞尔大学）；Charles University（查理大学）

本文提出了一种在格码顺序下以恒定延迟枚举poset理想和反链的算法，解决了长期存在的开放问题，并改进了现有算法。引入了Pyramid方法用于递归算法分析。

2026-03-30cs.DMcs.DS

有界度割的多项式大小枚举核

Enumeration Kernels of Polynomial Size for Cuts of Bounded Degree

本文针对d-CUT问题的三种枚举变体，基于顶点覆盖数、邻域多样性和团划分数等结构参数，分别提出多项式大小的多项式延迟/全多项式枚举核及双射枚举核，推进了枚举核化在该问题上的研究。

2025-04-20cs.DMcs.DS

多项式大小的枚举核化用于长路径枚举

Polynomial-Size Enumeration Kernelizations for Long Path Enumeration

针对长路径枚举问题，研究其枚举核化，为顶点覆盖数、解离数和到团的距离三个结构参数，给出多项式大小的多项式延迟枚举核。

2025-02-28cs.DM

循环可定向图上无弦圈的多项式计数

Polynomial enumeration of chordless cycles on cyclically orientable graphs

在有限无向简单图中，一个无弦圈是一个诱导子图，它是一个圈。一个图称为循环可定向的，如果它允许一个定向，其中每个无弦圈都是循环定向的。我们提出了一个算法来枚举这样的图的所有无弦圈。与其他同类算法相比，该算法的优点是在输入尺寸下只需查找一次无弦环，时间复杂度为$\mathcal{O}(n^2)$，其中$n$为顶点数。

2015-05-11cs.DMcs.DS

Refined Notions of Parameterized Enumeration Kernels with Applications to Matching Cut Enumeration

An enumeration kernel as defined by Creignou et al. [Theory Comput. Syst. 2017] for a parameterized enumeration problem consists of an algorithm that transforms each instance into one whose size is bounded by the parameter plus a solution-lifting algorithm that efficiently enumerates all solutions from the set of the solutions of the kernel. We propose to consider two new versions of enumeration kernels by asking that the solutions of the original instance can be enumerated in polynomial time or with polynomial delay from the kernel solutions. Using the NP-hard Matching Cut problem parameteriz…

2021-01-11cs.DMcs.DS

更多相关论文收起更多论文

多项式空间中潜在极大团的输出敏感枚举

Output-Sensitive Enumeration of Potential Maximal Cliques in Polynomial Space

针对潜在极大团枚举中现有输出多项式算法需指数空间的瓶颈，本文改进 Bouchitté–Todinca 算法，提出仅用多项式空间且保持输出多项式时间复杂度的枚举方法。

2024-02-28cs.DMcs.DS

Kirchhoff 多项式的素因式分解：树形图的紧凑枚举

Prime Factorization of the Kirchhoff Polynomial: Compact Enumeration of Arborescences

本文研究有向图全部有根树形图的枚举问题，通过给出与 Kirchhoff 多项式因式分解对应的图分解规则及因子素性条件，提出线性时间分解算法，并用于压缩枚举和实际图类分析。

2015-07-28cs.DMcs.DS

具有指数级大基集的拟阵中基的枚举

Enumeration of Bases in Matroid with Exponentially Large Ground Set

本文提出两种不依赖基集大小的拟阵基枚举算法，分别处理最小权重基和所有无权基，并首次给出割空间相关割的多项式延迟枚举。

2025-09-11cs.DMcs.DS

Enumerating Connected Dominating Sets

The question to enumerate all inclusion-minimal connected dominating sets in a graph of order $n$ in time significantly less than $2^n$ is an open question that was asked in many places. We answer this question affirmatively, by providing an enumeration algorithm that runs in time $\mathcal{O}(1.9896^n)$, using polynomial space only. The key to this result is the consideration of this enumeration problem on 2-degenerate graphs, which is proven to be possible in time $\mathcal{O}(1.9767^n)$. We also show new lower bound results by constructing a family of graphs of order $n$ with $Ω(1.4890^n)$ …

2022-04-29cs.CCcs.DMcs.DS

具有增量多项式延迟的所有极小边控制集的生成

Generating All Minimal Edge Dominating Sets with Incremental-Polynomial Delay

对于任意m边无向简单图G，给出了一个运行时间为O（m^4 |L| ^2）的生成G的所有极小边控制集的集合L的算法.对于二部图，我们得到了一个更好的结果，我们证明了它们的最小边控制集可以在O（m^4 |L|）的时间内计数。事实上，我们的结果更强;当L是已经生成的最小边控制集的集合时，这两个算法分别以增量多项式延迟O（m^5 |L|）和O（m^4 |L|）生成下一个最小边控制集。我们的算法是量身定制的，并解决了等价的问题，枚举最小（顶点）控制集的线图和线图的二分图，递增多项式延迟，因此在输出多项式时间。图的最小控制集的计数最近被证明是等价于超图的最小断面的计数。超图的最小断面是否能在输出多项式时间内计数是输出敏感计数中一个基本而又具有挑战性的问题，它已经公开了几十年，并引发了该领域的广泛研究。

2012-10-23cs.DMcs.DSmath.CO

具有Nice罗马支配性质的枚举

Enumeration With Nice Roman Domination Properties

本文提出了一种基于nice罗马支配性质的算法，用于高效枚举最小罗马支配函数，适用于多种图类型。

2025-11-25cs.CCcs.DM

非同构区间图的高效枚举

Efficient enumeration of non-isomorphic interval graphs

本文改进了非同构区间图的枚举算法，将时间延迟从 $O(n^4)$ 降至 $O(n^3 \log n)$，并扩展了目录至 $n$ 不超过 15 的所有图。

2021-03-03cs.DMmath.CO

超图对偶化：以退化度和维度为参数的FPT延迟算法

Hypergraph dualization with FPT-delay parameterized by the degeneracy and dimension

本文利用有序生成技术，针对超图极小横贯枚举问题，设计出以退化度和维度为参数的FPT延迟算法，解决了先前提出的开放问题。

2024-04-22cs.DMcs.DSmath.CO

闭包运算产生解的高效枚举

Efficient enumeration of solutions produced by closure operations

本文提出用多项式延迟枚举布尔关系在自同态下的闭包，并证明相应成员问题在布尔情形属P类，在更大定义域上对某些运算为NP难，同时将闭包极值生成与拟阵回路和超图极大独立集枚举等经典问题关联。

2019-06-05cs.CCcs.DMcs.DS

Design of Polynomial-delay Enumeration Algorithms in Transitive Systems

In this paper, as a new notion, we define a transitive system to be a set system $(V, {\mathcal C}\subseteq 2^V)$ on a finite set $V$ of elements such that every three sets $X,Y,Z\in{\mathcal C}$ with $Z\subseteq X\cap Y$ implies $X\cup Y\in{\mathcal C}$, where we call a set $C\in {\mathcal C}$ a component. We assume that two oracles $\mathrm{L}_1$ and $\mathrm{L}_2$ are available, where given two subsets $X,Y\subseteq V$, $\mathrm{L}_1$ returns a maximal component $C\in {\mathcal C}$ with $X\subseteq C\subseteq Y$; and given a set $Y\subseteq V$, $\mathrm{L}_2$ returns all maximal components …

2020-04-04cs.DM