Characterization and complexity of uniformly nonprimitive labeled 2-structures

Citations of this article
Mendeley users who have this article in their library.


According to the clan decomposition theorem of Ehrenfeucht and Rozenberg (1990) each labeled 2-structure has a decomposition into three types of basic 2-structures: complete, linear and primitive. This decomposition can be expressed as a node labeled tree, the shape of the 2-structure. Our main interest is in the uniformly nonprimitive 2-structures, which do not have primitive substructures. Every (directed) graph can be considered as a restricted 2-structure with only two labels (arc, no-arc). It is proved that forbidding primitivity in the 2-structures gives a unified approach to some well-known classes of graphs, viz., the cographs and the transitive vertex series-parallel graphs. We also study the parallel complexity of the decomposition of 2-structures. It is shown that there is a LOGCF algorithm, which recognizes the uniformly nonprimitive 2-structures and constructs their shapes. We prove also that for every MSO (monadic second-order) definable property of 2-structures, there is a LOGCF algorithm to decide whether or not a uniformly nonprimitive 2-structure has that property.




Engelfriet, J., Harju, T., Proskurowski, A., & Rozenberg, G. (1996). Characterization and complexity of uniformly nonprimitive labeled 2-structures. Theoretical Computer Science, 154(2), 247–282.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free