arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1604.00922cs.DS
收藏

单极图和广义分裂图的识别

Recognition of unipolar and generalised split graphs

Colin McDiarmid, Nikola Yolov

摘要:

一个图是单极的,如果它可以被划分成一个团和一个不相交的团的并,并且一个图是广义分裂图,如果它或它的补图是单极的。利用图的单极划分可以有效地求出团数、稳定数、色数以及解决一般图难以解决的问题。我们提出了第一个$O(n^2)$时间算法识别的$n$顶点单极和广义分裂图,改进以前的$O(n^3)$时间算法。

英文摘要:

A graph is unipolar if it can be partitioned into a clique and a disjoint union of cliques, and a graph is a generalised split graph if it or its complement is unipolar. A unipolar partition of a graph can be used to find efficiently the clique number, the stability number, the chromatic number, and to solve other problems that are hard for general graphs. We present the first $O(n^2)$ time algorithm for recognition of $n$-vertex unipolar and generalised split graphs, improving on previous $O(n^3)$ time algorithms.

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

↑