区间图散射数和Hamilton连通度的线性时间算法
Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs
摘要:
Hung和Chang证明了对于所有k>=1的区间图,其路径覆盖的大小至多为k当且仅当其散射数至多为k。他们还证明了一个区间图有一个Hamilton圈当且仅当它的散射数至多为0。证明了对所有k<=-1,区间图是-(k+1)-Hamilton连通的当且仅当它的散射数至多为k。我们还给出了计算n点m边区间图的散射数的一个O(m+n)时间算法,改进了Kratsch,Kloks和Müller的O(n^4)时间界.由于我们的两个结果的最大k,区间图是k-Hamilton连通的,可以计算在O(m+n)的时间。
英文摘要:
Hung and Chang showed that for all k>=1 an interval graph has a path cover of size at most k if and only if its scattering number is at most k. They also showed that an interval graph has a Hamilton cycle if and only if its scattering number is at most 0. We complete this characterization by proving that for all k<=-1 an interval graph is -(k+1)-Hamilton-connected if and only if its scattering number is at most k. We also give an O(m+n) time algorithm for computing the scattering number of an interval graph with n vertices an m edges, which improves the O(n^4) time bound of Kratsch, Kloks and Müller. As a consequence of our two results the maximum k for which an interval graph is k-Hamilton-connected can be computed in O(m+n) time.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。