 |
Laboratoire d'Informatique Algorithmique, Fondements et Applications |  |
|
Laboratoire d'Informatique Algorithmique, Fondements et Applications | |
| HAL: hal-00134605, version 1 |
| arXiv: cs.DS/0703013 |
| DOI: 10.1007/978-3-540-74839-7_9 |
| Detailed view |  Export this paper |
 |
| Graph-Theoretic Concepts in Computer Science 33rd International Workshop, WG 2007, Dornburg, Germany, June 21-23, 2007., Dornburg : Allemagne (2007) |
|
|
|
|
| NLC-2 graph recognition and isomorphism |
|
|
Vincent Limouzy 1Fabien De Montgolfier 1 |
|
|
| For the ANR Graal (Graph decomposition an algorithms) collaboration(s) |
|
|
| (2007-12-06) |
|
|
|
| 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. |
|
|
|
|
|
|
|
|
|
|
|
| 1: | Laboratoire d'informatique Algorithmique : Fondements et Applications (LIAFA) |
|
|
|
CNRS : UMR7089 – Université Paris VII - Paris Diderot |
|
|
|
|
|
|
|
|
|
| Subject | : | Computer Science/Data Structures and Algorithms |
|
|
| NLC-width – Recognition – Algorithm – NLC-2 graphs – Isomorphism |
|
|
|
|
|
| hal-00134605, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00134605 | |
| oai:hal.archives-ouvertes.fr:hal-00134605 | |
| From: Vincent Limouzy | |
| Submitted on: Friday, 2 March 2007 22:46:00 | |
| Updated on: Tuesday, 11 December 2007 20:00:05 | |
