arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1402.4642cs.CCcs.DMmath.CO
收藏

关于Helly圆弧图的同构问题

On the Isomorphism Problem for Helly Circular-Arc Graphs

Johannes Köbler, Sebastian Kuhnert, Oleg Verbitsky

摘要:

已知同构问题对于区间图是有效可解的,而对于更大类的圆弧图,其复杂性状态保持开放。我们考虑满足Helly性质的圆弧族的交图的中间类。我们在对数空间中解决了该类的同构问题。如果一个输入图有一个Helly圆弧模型,我们的算法构造它的规范,这意味着同构图构造的模型是平等的。

英文摘要:

The isomorphism problem is known to be efficiently solvable for interval graphs, while for the larger class of circular-arc graphs its complexity status stays open. We consider the intermediate class of intersection graphs for families of circular arcs that satisfy the Helly property. We solve the isomorphism problem for this class in logarithmic space. If an input graph has a Helly circular-arc model, our algorithm constructs it canonically, which means that the models constructed for isomorphic graphs are equal.

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

↑