NLC-2 graph recognition and isomorphism

Authors:
Vincent Limouzy;Fabien De Montgolfier;Michaël Rao
Affiliations:
LIAFA, Univ. Paris Diderot;LIAFA, Univ. Paris Diderot;LIAFA, Univ. Paris Diderot
Venue:
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Year:
2007

Citing 6
Cited 2

Recognizing circle graphs in polynomial time

Journal of the ACM (JACM)
Handle-rewriting hypergraph grammars

Journal of Computer and System Sciences
k-NLC graphs and polynomial algorithms

Discrete Applied Mathematics - Special issue: efficient algorithms and partial k-trees
Modular decomposition and transitive orientation

Discrete Mathematics - Special issue on partial ordered sets
Parallel algorithms for hierarchical clustering and applications to split decomposition and parity graph recognition

Journal of Algorithms
Minimizing nLC-width is nP-complete

WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science

On a disparity between relative cliquewidth and relative NLC-width

Discrete Applied Mathematics
Polynomial-time recognition of clique-width ≤3 graphs

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

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.