NLC-2图的识别与同构
NLC-2 graph recognition and isomorphism
摘要：
NLC-宽度是宽度的一种变体，在图算法中有许多应用。本文主要研究NLC-宽度为2的图。在给出该类新的结构性质后，我们提出了一个$O(n^2 m)$ -时间算法，改进了Johansson的算法\cite{Johansson00} .此外，我们的算法是简单的理解。上述性质和算法使我们能够提出一个鲁棒的NLC-2图的$O(n^2 m)$ -时间同构算法。据我们所知，它是第一个多项式时间算法。
英文摘要：
NLC-width is a variant of clique-width with many application in graph algorithmic. This paper is devoted to graphs of NLC-width two. After giving new structural properties of the class, we propose a $O(n^2 m)$-time algorithm, improving Johansson's algorithm \cite{Johansson00}. Moreover, our alogrithm is simple to understand. The above properties and algorithm allow us to propose a robust $O(n^2 m)$-time isomorphism algorithm for NLC-2 graphs. As far as we know, it is the first polynomial-time algorithm.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
