纠缠2的无向图
Undirected Graphs of Entanglement Two
摘要：
纠缠度是有向图的复杂性度量，起源于不动点理论。这一措施已被证明在设计有效的算法，以验证过渡系统的逻辑属性。我们感兴趣的问题是决定一个图是否有纠缠在最多k。由于这个措施是通过游戏定义的，游戏理论的思想自然会导致设计多项式算法，对于固定的k，决定问题。已知的有向图的纠缠最多1导致的特征，k = 1，设计更快的算法。在本文中，我们提出了一个明确的特征无向图的纠缠最多为2。有了这样一个特性，我们设计了一个线性时间算法来决定一个无向图是否具有此属性。
英文摘要：
Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical properties of transition systems. We are interested in the problem of deciding whether a graph has entanglement at most k. As this measure is defined by means of games, game theoretic ideas naturally lead to design polynomial algorithms that, for fixed k, decide the problem. Known characterizations of directed graphs of entanglement at most 1 lead, for k = 1, to design even faster algorithms. In this paper we present an explicit characterization of undirected graphs of entanglement at most 2. With such a characterization at hand, we devise a linear time algorithm to decide whether an undirected graph has this property.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
