Abstract
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(n2m)-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(n2m)-time isomorphism algorithm for NLC-2 graphs. As far as we know, it is the first polynomial-time algorithm. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Limouzy, V., De Montgolfier, F., & Rao, M. (2007). NLC-2 graph recognition and isomorphism. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4769 LNCS, pp. 86–98). Springer Verlag. https://doi.org/10.1007/978-3-540-74839-7_9
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
