上图和分裂图范畴积的独立集
Independent set in categorical products of cographs and splitgraphs
摘要：
我们表明，有多项式时间的算法来计算最大独立集的两个cographs和两个splitgraphs的分类产品。证明了上图的最终分类独立比在多项式时间内是可计算的。
英文摘要：
We show that there are polynomial-time algorithms to compute maximum independent sets in the categorical products of two cographs and two splitgraphs. We show that the ultimate categorical independence ratio is computable in polynomial time for cographs.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
