Theory of 2-structures. Part I: clans, basic subclasses, and morphisms
TLDR
It is demonstrated that each 2-structure can be constructed from (decomposed into) three sorts of “basic” 2-structures, which are obtained through a (hierarchical) representation of 2-Structures by trees.About:
This article is published in Theoretical Computer Science.The article was published on 1990-02-15 and is currently open access. It has received 101 citations till now. The article focuses on the topics: Morphism.read more
Citations
More filters
Journal ArticleDOI
Modular decomposition and transitive orientation
TL;DR: This work gives O(n+m) algorithms for modular decomposition and transitive orientation, where n and m are the number of vertices and edges of the graph and linear time bounds for recognizing permutation graphs, maximum clique and minimum vertex coloring on comparability graphs, and other combinatorial problems on comparable graphs and their complements.
Journal ArticleDOI
Partial (set) 2-structures. Part I: basic notions and the representation problem
TL;DR: Part I of this paper investigates the basic theory of labeled partial 2-structures and it considers the problem of representing partial 2 -structures as partial set 2- Structures.
Book ChapterDOI
A New Linear Algorithm for Modular Decomposition
Alain Cournier,Michel Habib +1 more
TL;DR: This work presents a new algorithm linear in time and space complexity for Modular Decomposition that builds and explores the decomposition tree of any undirected graph in a depth-first search way and shows that a vertex-splitting operation is really a central tool for modular decomposition algorithms.
Journal ArticleDOI
Partial (set) 2-structures. Part II: state spaces of concurrent systems
TL;DR: Applications to the theory of net-based concurrent systems and the problem of synthesizing state spaces of basic classes of Petri nets from their “abstract” descriptions in the form of directed edge-labeled graphs are investigated.
Journal ArticleDOI
Linear-time recognition of circular-arc graphs
TL;DR: A linear-time algorithm is given for recognizing a class of graphs called circular-arc graphs, where there is one arc for each vertex of G, and two vertices are adjacent in G if and only if the corresponding arcs intersect.
References
More filters