Structural parameters of graph (such as degeneracy and arboricity) had rarely been considered when designing algorithms for $\textit{(edge) clique cover}$ problems. Taking degeneracy of graph into account, we present a greedy framework and two fixed-parameter tractable algorithms for $\textit{clique cover}$ problems. We introduce a set theoretic concept and demonstrate its use in the computations of different objectives of $\textit{clique cover}$. Furthermore, we show efficacy of our algorithms in practice.
翻译：在设计 $\ textit{( gedge) cloique cloique cover} $ 的算法时,很少考虑图的结构参数( 诸如 egenerity ) 和 obricity ) 的结构参数 。 考虑到图表的退化性, 我们提出了一个贪婪的框架和两个固定参数可移动的算法 $\ textit{ cloique cloit} $ 的问题。 我们引入了一套理论概念, 并在计算 $\ textit{ cloique cloique cover} $ 的不同目标时演示了它的应用 。 此外, 我们展示了我们算法的实际效果 。
相关内容
微信扫码咨询专知VIP会员