NLC-2 Graph Recognition and Isomorphism

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(n2 m)-time algorithm, improving Johansson's algorithm [14]. Moreover, our alogrithm is simple to understand. The above properties and algorithm allow us to propose a robust O(n2 m)-time isomorphism algorithm for NLC-2 graphs. As far as we know, it is the rst polynomial-time algorithm.

• Type: Conference
• Year: 2007
• Where: WG
• Authors: Vincent Limouzy, Fabien de Montgolfier, Michaël Rao
• Keywords: Algorithm, Computer Science, M)-time Isomorphism Algorithm, Rst Polynomial-time Algorithm, WG 2007