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

几类图的D2CS计数算法

Algorithms for enumerating and counting D2CS of some graphs

P. Venkata Subba Reddy, K. Viswanathan Iyer

摘要:

图G的D2CS是具有$diam(G[S]) \leq 2$的集合$S \subseteq V(G)$。研究了图的D2CS的计数和枚举问题。首先给出了完全k叉树、Fibonacci树、二元Fibonacci树和二叉树中D2CS个数的显式表达式。其次,我们给出了一个图的D2CS的枚举和计数算法。然后,我们给出了一个线性时间算法,寻找所有的最大D2CS的强弦图。

英文摘要:

A D2CS of a graph G is a set $S \subseteq V(G)$ with $diam(G[S]) \leq 2$. We study the problem of counting and enumerating D2CS of a graph. First we give an explicit formula for the number of D2CS in a complete k-ary tree, Fibonacci tree, binary Fibonacci tree and the binomial tree. Next we give an algorithm for enumerating and counting D2CS of a graph. We then give a linear time algorithm for finding all maximal D2CS in a strongly chordal graph.

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

↑