arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1304.2618math.COcs.DMcs.ITmath.IT
收藏

词典识别码

Lexicographic identifying codes

Maximilien Gadouleau

摘要:

图中的标识码是与顶点邻域对之间的所有对称差相交的顶点集合。并不是所有的图都有识别码;有识别码的图被称为无孪生图。在本文中,我们设计了一个算法,在O(n^3)二元运算中找到一个在n个顶点上的无孪生图中的标识码,并且如果图不是无孪生图则返回失败。我们还确定了一个替代稀疏图的运行时间为O(n^2d log n)二元运算,其中d是最大程度。我们还证明了这些算法可以返回任何识别码的基数最小,只要顶点是正确排序。

英文摘要:

An identifying code in a graph is a set of vertices which intersects all the symmetric differences between pairs of neighbourhoods of vertices. Not all graphs have identifying codes; those that do are referred to as twin-free. In this paper, we design an algorithm that finds an identifying code in a twin-free graph on n vertices in O(n^3) binary operations, and returns a failure if the graph is not twin-free. We also determine an alternative for sparse graphs with a running time of O(n^2d log n) binary operations, where d is the maximum degree. We also prove that these algorithms can return any identifying code with minimum cardinality, provided the vertices are correctly sorted.

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

↑