arXivDaily arXiv每日学术速递 周一至周五更新
arXiv cs/0609109cs.LOmath.LO
收藏

图集合的可识别性是一个鲁棒性质

The recognizability of sets of graphs is a robust property

Bruno Courcelle, Pascal Weil

摘要:

一旦有限图的集合具有代数结构(由概括单词连接的运算的定义产生),就可以用有限同余来定义可识别的图的集合的概念。应用程序的建设,有效的算法和理论的上下文无关集的图形自然遵循。可识别集的类依赖于图运算的签名。我们考虑三个签名分别与超边替换(HR)上下文无关的图形文法,顶点替换(VR)上下文无关的图形文法,和模块化分解的图形。我们比较了相应的类的可识别集。我们表明,他们是强大的意义上说,每个签名的许多变体(特别是操作定义的量化器免费的公式,一个非常灵活的框架)产生相同的概念的可识别性。证明了对于不含大完全二部子图的图,HR-可识别性和VR-可识别性是一致的。相同的组合条件等同于HR-上下文自由和VR-上下文自由图集。结果尽可能在关系结构的更一般的框架中表述。

英文摘要:

Once the set of finite graphs is equipped with an algebra structure (arising from the definition of operations that generalize the concatenation of words), one can define the notion of a recognizable set of graphs in terms of finite congruences. Applications to the construction of efficient algorithms and to the theory of context-free sets of graphs follow naturally. The class of recognizable sets depends on the signature of graph operations. We consider three signatures related respectively to Hyperedge Replacement (HR) context-free graph grammars, to Vertex Replacement (VR) context-free graph grammars, and to modular decompositions of graphs. We compare the corresponding classes of recognizable sets. We show that they are robust in the sense that many variants of each signature (where in particular operations are defined by quantifier-free formulas, a quite flexible framework) yield the same notions of recognizability. We prove that for graphs without large complete bipartite subgraphs, HR-recognizability and VR-recognizability coincide. The same combinatorial condition equates HR-context-free and VR-context-free sets of graphs. Inasmuch as possible, results are formulated in the more general framework of relational structures.

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

↑