梯形图的图同构完全性
Graph isomorphism completeness for trapezoid graphs
摘要：
梯形图的图同构问题的复杂性已经公开了十多年。本文证明了该问题是GI-完全的。更确切地说，我们证明了图同构问题是GI-完全的可比图的偏序集的区间维数为2和高度为3。与此相反，已知的问题是可解决的多项式时间的可比性图的偏序集的区间维数最多为2和高度最多为2。
英文摘要：
The complexity of the graph isomorphism problem for trapezoid graphs has been open over a decade. This paper shows that the problem is GI-complete. More precisely, we show that the graph isomorphism problem is GI-complete for comparability graphs of partially ordered sets with interval dimension 2 and height 3. In contrast, the problem is known to be solvable in polynomial time for comparability graphs of partially ordered sets with interval dimension at most 2 and height at most 2.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
