实用高效的圆图识别
Practical and Efficient Circle Graph Recognition
摘要：
圆图是圆中弦的交图。本文提出了圆图类的第一个次二次识别算法。我们的算法是O（n + m）乘以逆Ackermann函数α（n + m），α（n + m）的值对于任何实际图都小于4。该算法是基于一个新的增量字典广度优先搜索特性的圆图，和一个新的有效的数据结构的圆图，都在文件中开发。该算法是一个扩展的分裂分解算法，具有相同的运行时间，作者在一个同伴的文件。
英文摘要：
Circle graphs are the intersection graphs of chords in a circle. This paper presents the first sub-quadratic recognition algorithm for the class of circle graphs. Our algorithm is O(n + m) times the inverse Ackermann function, α(n + m), whose value is smaller than 4 for any practical graph. The algorithm is based on a new incremental Lexicographic Breadth-First Search characterization of circle graphs, and a new efficient data-structure for circle graphs, both developed in the paper. The algorithm is an extension of a Split Decomposition algorithm with the same running time developed by the authors in a companion paper.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
