arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2601.14906cs.LOcs.DM
收藏

稀疏图类的转导反向高效算法

Efficient reversal of transductions of sparse graph classes

TU Wien(维也纳工业大学);Masaryk University(马萨里克大学);University of Warsaw(华沙大学)

Jan Dreier, Jakub Gajarský, Michał Pilipczuk

AI总结:

本文提出一种高效算法,用于稀疏图类的转导反向,通过一阶解释恢复原图并保证邻域复杂度线性。

摘要:

(一阶)转导是一种基本概念,用于捕捉可以用一阶逻辑描述的图修改。在本工作中,我们提出了一种高效的算法方法,用于近似反向转导的应用,假设源图是稀疏的。具体而言,对于任何具有结构有界扩张(即可以由有界扩张的类转导)的图类C,我们给出一个O(n⁴)时间的算法,给定图G∈C,计算一个顶点着色图H,使得G可以通过H的一阶解释恢复,并且H属于具有有界扩张的图类D。这回答了Gajarský等人提出的一个开放问题。实际上,为了使我们的程序有效,我们只需要假设C是单调稳定的(即不转导所有半图类)并且具有本质上线性邻域复杂度(即邻域复杂度在所有可由C转导的图类中是线性的)。这导致结论:满足这两个性质的图类与具有结构有界扩张的图类一致。

英文摘要:

(First-order) transductions are a basic notion capturing graph modifications that can be described in first-order logic. In this work, we propose an efficient algorithmic method to approximately reverse the application of a transduction, assuming the source graph is sparse. Precisely, for any graph class $\mathcal{C}$ that has structurally bounded expansion (i.e., can be transduced from a class of bounded expansion), we give an $O(n^4)$-time algorithm that given a graph $G\in \mathcal{C}$, computes a vertex-colored graph $H$ such that $G$ can be recovered from $H$ using a first-order interpretation and $H$ belongs to a graph class $\mathcal{D}$ of bounded expansion. This answers an open problem raised by Gajarský et al. In fact, for our procedure to work we only need to assume that $\mathcal{C}$ is monadically stable (i.e., does not transduce the class of all half-graphs) and has inherently linear neighborhood complexity (i.e., the neighborhood complexity is linear in all graph classes transducible from $\mathcal{C}$). This renders the conclusion that the graph classes satisfying these two properties coincide with classes of structurally bounded expansion.

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

↑