arXiv 0812.35932008-12-18cs.CCmath.CO

A randomized polynomial-time algorithm for the Spanning Hypertree Problem on 3-uniform hypergraphs

Sergio Caracciolo, Gregor Masbaum, Alan D. Sokal, Andrea Sportiello

备注：: 6 pages, 1 figure

英文摘要：

Consider the problem of determining whether there exists a spanning hypertree in a given k-uniform hypergraph. This problem is trivially in P for k=2, and is NP-complete for k>= 4, whereas for k=3, there exists a polynomial-time algorithm based on Lovasz' theory of polymatroid matching. Here we give a completely different, randomized polynomial-time algorithm in the case k=3. The main ingredients are a Pfaffian formula by Vaintrob and one of the authors (G.M.) for a polynomial that enumerates spanning hypertrees with some signs, and a lemma on the number of roots of polynomials over a finite field.

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

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

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

继续探索

相关论文

Approximating acyclicity parameters of sparse hypergraphs

The notions of hypertree width and generalized hypertree width were introduced by Gottlob, Leone, and Scarcello in order to extend the concept of hypergraph acyclicity. These notions were further generalized by Grohe and Marx, who introduced the fractional hypertree width of a hypergraph. All these width parameters on hypergraphs are useful for extending tractability of many problems in database theory and artificial intelligence. In this paper, we study the approximability of (generalized, fractional) hyper treewidth of sparse hypergraphs where the criterion of sparsity reflects the sparsity …

2008-09-22cs.CCcs.DS

Computing hypergraph width measures exactly

Hypergraph width measures are a class of hypergraph invariants important in studying the complexity of constraint satisfaction problems (CSPs). We present a general exact exponential algorithm for a large variety of these measures. A connection between these and tree decompositions is established. This enables us to almost seamlessly adapt the combinatorial and algorithmic results known for tree decompositions of graphs to the case of hypergraphs and obtain fast exact algorithms. As a consequence, we provide algorithms which, given a hypergraph H on n vertices and m hyperedges, compute the gen…

2011-06-23cs.CCcs.DS

超图中的Steiner连通性问题

Steiner connectivity problems in hypergraphs

本文研究超图中的Steiner连通性问题，证明判定Steiner超树存在性及两类Steiner定向问题均为NP完全，回答了Egerváry研究组的公开问题，并证明终端数固定时可在多项式时间内求解。

2023-04-12cs.CCcs.DMmath.CO

分数和广义超树宽度的FPT参数化

FPT Parameterisations of Fractional and Generalised Hypertree Width

TU Wien（维也纳工业大学）；University of Durham（杜伦大学）

本文首次提出基于目标宽度、秩和最大度数的FPT算法，用于精确计算广义超树宽度和分数超树宽度，并扩展至更广泛的宽度函数类，为后续优化提供了结构工具。

2026-03-13cs.CCcs.DS

稀疏关联和有界独立模式上的同态问题的FPT=PTIME

FPT=PTIME for Homomorphism Problems on Sparse-Incidence and Bounded-Independence Patterns

Institute of Logic and Computation, TU Wien（逻辑与计算研究所，维也纳科技大学）

本研究证明在ETH下，对有界关联退化或有界原始独立数的模式超图，同态问题的固定参数可处理性与多项式时间可解性等价，由分数超树宽刻画，并给出近线性上界及计数坍缩结果。

2026-09-21cs.CCcs.DB

在线向量装箱与超图着色新解：更简证明与新联系

Online Vector Bin Packing and Hypergraph Coloring Illuminated: Simpler Proofs and New Connections

本文简化了在线向量装箱与超图着色的证明，建立新联系并改进下界，解决了超树情形的紧界猜想。

2023-06-20cs.CCcs.DS

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

Tractable hypergraph properties for constraint satisfaction and conjunctive queries

An important question in the study of constraint satisfaction problems (CSP) is understanding how the graph or hypergraph describing the incidence structure of the constraints influences the complexity of the problem. For binary CSP instances (i.e., where each constraint involves only two variables), the situation is well understood: the complexity of the problem essentially depends on the treewidth of the graph of the constraints. However, this is not the correct answer if constraints with unbounded number of variables are allowed, and in particular, for CSP instances arising from query evalu…

2011-12-06cs.CCcs.DBcs.DM

超图采样器：典型情况与最坏情况行为

Hypergraph Samplers: Typical and Worst Case Behavior

University of Haifa（海法大学）

研究超图采样在误差减少中的典型与最坏情况行为，证明了超图在误差减少中的下界及伪随机种子的有效性。

2026-01-27cs.CCcs.DSmath.CO

有界度超图的性质测试

Property Testing in Bounded Degree Hypergraphs

本文将性质测试扩展到有界度超图，给出有界树宽超图中k-部性测试的查询复杂度与n无关的随机算法，并证明k-可着色性、k-部性和独立数测试的Ω(n)最优下界。

2025-03-13cs.CCcs.DM

平均情况超图的一个快速染色预言机

A Fast Coloring Oracle for Average Case Hypergraphs

本文提出了一种简单且基础的确定性2-染色算法，避免了regularity lemma，重新证明了平均情况超图2-可染性的相关定理，并进一步设计出平均期望运行时间仅为O(1)的快速染色预言机。

2025-07-14cs.CCcs.DSmath.CO

The Ising Partition Function: Zeros and Deterministic Approximation

We study the problem of approximating the partition function of the ferromagnetic Ising model in graphs and hypergraphs. Our first result is a deterministic approximation scheme (an FPTAS) for the partition function in bounded degree graphs that is valid over the entire range of parameters $β$ (the interaction) and $λ$ (the external field), except for the case $\vertλ\vert=1$ (the "zero-field" case). A randomized algorithm (FPRAS) for all graphs, and all $β,λ$, has long been known. Unlike most other deterministic approximation algorithms for problems in statistical physics and counting, our al…

2018-06-28cond-mat.stat-mechcs.CCcs.DM

Enumeration of the Monomials of a Polynomial and Related Complexity Classes

We study the problem of generating monomials of a polynomial in the context of enumeration complexity. In this setting, the complexity measure is the delay between two solutions and the total time. We present two new algorithms for restricted classes of polynomials, which have a good delay and the same global running time as the classical ones. Moreover they are simple to describe, use little evaluation points and one of them is parallelizable. We introduce three new complexity classes, TotalPP, IncPP and DelayPP, which are probabilistic counterparts of the most common classes for enumeration …

2010-04-18cs.CC