用Z字形图识别（单位）区间图
Recognizing (Unit) Interval Graphs by Zigzag Graph Searches
摘要：
Corneil，Olariu和Stewart [SODA 1998; SIAM Journal on离散数学2009]提出了一种通过六个图搜索的区间图识别算法。Li和Wu [离散数学\&理论计算机科学2014]将其简化为四个。然而，后者算法的巨大简单性却被复杂而冗长的证明所掩盖。本文的主要目的是提出一个新的和显着短的证明李和吴的算法，以及一个更简单的实现。我们还给出了一个独立的简单的解释的识别算法的Corneil [离散应用数学2004年]的单位区间图，基于三个扫描的图形搜索。此外，我们表明，两次扫描已经足够了。对主要结果的证明，我们提出了几个新的结构观察，可能是独立的利益。
英文摘要：
Corneil, Olariu, and Stewart [SODA 1998; SIAM Journal on Discrete Mathematics 2009] presented a recognition algorithm for interval graphs by six graph searches. Li and Wu [Discrete Mathematics \& Theoretical Computer Science 2014] simplified it to only four. The great simplicity of the latter algorithm is however eclipsed by the complicated and long proofs. The main purpose of this paper is to present a new and significantly short proof for Li and Wu's algorithm, as well as a simpler implementation. We also give a self-contained simpler interpretation of the recognition algorithm of Corneil [Discrete Applied Mathematics 2004] for unit interval graphs, based on three sweeps of graph searches. Moreover, we show that two sweeps are already sufficient. Toward the proofs of the main results, we make several new structural observations that might be of independent interests.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
