NLC-2 graph recognition and isomorphism - Archive ouverte HAL Access content directly
Conference Papers Year : 2007

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(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.
Fichier principal
Vignette du fichier
nlc2.pdf (288.56 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00134605 , version 1 (02-03-2007)



Vincent Limouzy, Fabien de Montgolfier, Michaël Rao. NLC-2 graph recognition and isomorphism. Graph-Theoretic Concepts in Computer Science 33rd International Workshop, WG 2007, Dornburg, Germany, June 21-23, 2007., Jun 2007, Dornburg, Germany. pp.86-98, ⟨10.1007/978-3-540-74839-7_9⟩. ⟨hal-00134605⟩
82 View
79 Download



Gmail Facebook X LinkedIn More