arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0811.0454math.CO
收藏

关于贪婪定义集的更多结果

More results on greedy defining sets

Manouchehr Zaker

摘要:

图的贪婪定义集在[M. Zaker,Greedy defining sets of graphs,Australas. J. Combin,2001年]。证明了确定二部图的贪婪定义数是一个NP完全问题。这一结果肯定地回答了前文中提到的问题。它还表明,这个数字的森林可以在多项式时间内确定。然后给出了一种求拉丁方贪婪定义集的方法,并证明了任意$n\times n$拉丁方的GDS最大为$n^2-(n\log n)/4$ .最后给出了贪婪定义集在设计实用秘密共享方案中的应用。

英文摘要:

The greedy defining sets of graphs were appeared first time in [M. Zaker, Greedy defining sets of graphs, Australas. J. Combin, 2001]. We show that to determine the greedy defining number of bipartite graphs is an NP-complete problem. This result answers affirmatively the problem mentioned in the previous paper. It is also shown that this number for forests can be determined in polynomial time. Then we present a method for obtaining greedy defining sets in Latin squares and using this method, show that any $n\times n$ Latin square has a GDS of size at most $n^2-(n\log n)/4$. Finally we present an application of greedy defining sets in designing practical secret sharing schemes.

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

↑